Jun 16, 2025
Оfftopic Community
Оfftopic Community
Forums
New posts
Search forums
What's new
Featured content
New posts
New media
New media comments
New resources
New profile posts
Latest activity
Media
New media
New comments
Search media
Resources
Latest reviews
Search resources
Members
Current visitors
New profile posts
Search profile posts
Log in
Register
What's new
Search
Search
Search titles only
By:
New posts
Search forums
Menu
Log in
Register
Install the app
Install
Forums
Technology
Satellite
How do i maximise, (a*n1+b*n2+c*n3)<d, when n1, n2 and n3 are real positive
JavaScript is disabled. For a better experience, please enable JavaScript in your browser before proceeding.
You are using an out of date browser. It may not display this or other websites correctly.
You should upgrade or use an
alternative browser
.
Reply to thread
Message
<blockquote data-quote="lPainel" data-source="post: 2692059" data-attributes="member: 906394"><p>unknown integers...? and the coefficients a, b, c and d are unique and known with (a,b,c)<d. Is there a known procedure? I can brute force a solution(s), i just wonder if there is a better way.</p><p>and a,b,c and d are real and positive.</p><p>Gianlino, i'd like to find values where the lhs is at its maximum value with respect to d. Ideally when n1+n2+n3 is small. For example, when a=2.5, b=1.5, c=1.1</p><p></p><p></p><p> </p><p> (n1) , (n2) , (n3) ,(a*n1+b*n2+c*n3) , d </p><p> 2.0000, 1.0000, 5.0000, 12.0000, 12.0000</p><p> 3.0000, 3.0000, 0, 12.0000, 12.1000</p><p> 1.0000, 2.0000, 6.0000, 12.1000, 12.2000</p><p> 3.0000, 1.0000, 3.0000, 12.3000, 12.3000</p><p> 2.0000 2.0000, 4.0000, 12.4000, 12.4000</p><p></p><p>etc.</p><p>note those values are for (a*n1+b*n2+c*n3)</p><p>note those values are for (a*n1+b*n2+c*n3) less than are equal to d</p><p>You can rewrite the constraints as:</p><p>0</p><p>it seems yahoo cuts off text with a less than or equal to symbols, irritating...</p><p>You can rewrite the constraints as:</p><p>0 less than n1 less than (d/a)</p><p>0 less than n2 less than (d-a*n1)/b</p><p>0 less than n3 less than or equal to (-a*n1*n2-b*n2*n3+d)/c</p><p>which might be quicker but is still ugly.</p></blockquote><p></p>
[QUOTE="lPainel, post: 2692059, member: 906394"] unknown integers...? and the coefficients a, b, c and d are unique and known with (a,b,c)<d. Is there a known procedure? I can brute force a solution(s), i just wonder if there is a better way. and a,b,c and d are real and positive. Gianlino, i'd like to find values where the lhs is at its maximum value with respect to d. Ideally when n1+n2+n3 is small. For example, when a=2.5, b=1.5, c=1.1 (n1) , (n2) , (n3) ,(a*n1+b*n2+c*n3) , d 2.0000, 1.0000, 5.0000, 12.0000, 12.0000 3.0000, 3.0000, 0, 12.0000, 12.1000 1.0000, 2.0000, 6.0000, 12.1000, 12.2000 3.0000, 1.0000, 3.0000, 12.3000, 12.3000 2.0000 2.0000, 4.0000, 12.4000, 12.4000 etc. note those values are for (a*n1+b*n2+c*n3) note those values are for (a*n1+b*n2+c*n3) less than are equal to d You can rewrite the constraints as: 0 it seems yahoo cuts off text with a less than or equal to symbols, irritating... You can rewrite the constraints as: 0 less than n1 less than (d/a) 0 less than n2 less than (d-a*n1)/b 0 less than n3 less than or equal to (-a*n1*n2-b*n2*n3+d)/c which might be quicker but is still ugly. [/QUOTE]
Insert quotes…
Name
Verification
Please enable JavaScript to continue.
Loading…
Post reply
Top