Solves a Linear Programming problem
supplied by the user, by Dantzig's simplex method.
#In the standard form: all the constraints must be given
as equations, typically after insertion of slack
or artificial variables;
and with non-negative right-hand side constants,
i.e., b ≥ 0.
If any artificial variable is present, its coefficient (given as 0)
will be made ±M, according to the direction
of optimization ('+' for min, '−' for max).
Base problem is: Case 0 — Bronson 4.2; z*min = 71 2/3, X = (7/12, 5/12) =
(0.58(3), 0.41(6))
 Other data.pdf...
#A plot of the objective function, z, is presented
as a function of the successive bases.
The initial basis is № 0. |
