
Specialized Linear Program
Posted:
Apr 25, 2013 9:32 PM


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?

