General Form of a Linear Program.
Minimize b1y1 + b2y2 +…+ bmym
subject to S 1<=i<= m aijyi >= cj j=1..n
yi >= 0 i=1..m
or
Maximize c1x1 + c2x2 +…+ cnxn
subject to S 1<=j<= n aijxj <= bj i=1..m
xj>= 0 j=1..n
Previous slide
Next slide
Back to first slide
View graphic version