The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » sci.math.* » sci.math

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Specialized Linear Program
Replies: 4   Last Post: Apr 27, 2013 9:38 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]

Posts: 139
Registered: 4/27/05
Specialized Linear Program
Posted: Apr 25, 2013 9:32 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

Max sum over j c(j).x(j)
sum over j a(i,j) . x(j) <= b(i) for i = 1,2,..m.
x(j) >= 0 for j = 1,2,...n.

All a's,b's and c's are >= 0.

This LP has the property that x feasible implies x' feasible whenever
0<=x'(j) <= x(j) for all j.

Are these problems any easier than general LPs?

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.