For MILP problems (at least
one integer variable), go to
Using CPLEX: MIP.
Solves a Linear Programming (LP) problem
given as a '.csv' file, using CPLEX
(from a Fortran 90 calling program).
The file: can be in "American" or "European" style.
It must contain: in the 1.st row, the objective function coefficients;
in the following rows, the constraints (see the base example).
#Suggested problems:
juice, lp_juice.lp
(z* = 403.125);
diet, lp_diet.lp
(z* = 14.856);
HPW prb_19, lp_hpw19.lp
(z* = 198.5);
diet, lp_SAS_diet.lp
(z* = 12.081)
Acknowledgements See, e.g.,
the MILP reference, above. |
 |
