Next:
The Simplex and
Up:
Summary (B)
Previous:
Summary (B)
Linear Programming
Minimize
c x
with
A x = b
,
.
Extreme points of feasible sets.
Inequality constraints.
HPF demo web account
Mon Nov 18 19:45:42 EST 1996