Generates random data for
a Linear Programming problem. The data are c, A and b,
such that, as usual, the problem will be
[max|min] z = cTx subject to
Ax ≤ b. These data are meant to fit
the revised simplex ⤤plate.
Only the case amenable to the (simple) standard form
is considered, i.e., containing only slack variables
and no artificial variables. The necessary identity sub-matrix is produced.
Also, b will be converted to |b|, to avoid any
negative generated values (which would lead to the need of artificials).
Examples:
(a) with seed = 7531, z* = 45.25, in 8 iterations;
(b) with (-100, +100) and seed = 7531, z = 3896.2
after 12 iterations and becomes unbounded.
|
