CT |
Coefficients in the objective function,
z = CT x .
|
• Use (here) 0 for the artificial variables
(RHS b ≥ 0).
• Decimal mark: American (.) or European (,)
• Separation by: blanks, (Excel type) tabs, ";". • |
Solves a Linear Programming problem
supplied by the user in standard form, by Dantzig's
simplex method in the revised simplex (i.e., matrix) form.
In the standard form: all the constraints must be given
as equations, typically after insertion of slack
(or surplus) 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 (automatically) made ±M, according to the direction
of optimization ('+' for min, '−' for max).
This follows the basic ("manual") procedure.
Basis 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 (copy-paste); Ramalhete.xlsx
(copy-paste from Excel), z* = 1012.9; lp_diet
.txt,
.lp,
.xlsx,
z* = 14.86
A plot of the objective function, z, is presented
as a function of the successive bases.
The initial basis is № 0. |