Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

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


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

Topic: Specialized Linear Program
Replies: 2   Last Post: Apr 25, 2013 10:32 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
analyst41@hotmail.com

Posts: 121
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)
St
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]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.