©
Using CPLEX: LP
Uses the CPLEX API to solve an LP problem (continuous variables).
2024.Jul.03 20:40:21
'.lp' file

For MILP problems (at least one integer variable), go to Using CPLEX: MIP.

Solves a Linear Programming (LP) problem using the IBM ILOG CPLEX software. The CPLEX API is used with a Fortran 90 calling program. The data structure must be the '.lp' CPLEX type.

The base problem is the "lp_diet" problem (below).

This ready-to-execute version differs from the "empty" version due to the inclusion of the 'lp' formulation. This, however, leads to errors from the W3C Markup Validation Service (as per its icon in the lower left corner), because of the < or > signs.

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)

NB In the results, add 1 to 'ncol' (C language count), i.e., 'variables' = 'ncol' + 1.

Acknowledgements We thank the diligent endeavour of engineer Jorge Soares and Duarte Caldas (IBM).

IBM
References: Plate: filled_CPLEX_fortran90

• Wikipedia: IBM ILOG CPLEX

• IBM ILOG CPLEX V12.6.3 documentation — User's Manual.pdf (564 pp) or here.pdf.

• CPLEX LP Solution status codes: 1 Opt; 2 infeasible; 3 unbounded; 4–18 anomalies; 19 infeasible or unbounded.

• CPLEX LP file format.pdf   (lp file format)

• CPLEX Writing files. API Overview. Laboratori de CĂ lcul

CPLEX 6.6 Documentation, 1999? (Mathematical Sciences, School of Science, Rensselaer Polytechnic Institute)

Williams, H. P., |Distribution 1| (Problem 19), in Williams, H. P., 2008.

NEOS Server: (submit) state-of-the-art solvers for Numerical Oprimization.

• SAS Example 7.1 Diet Problem.

• 1755-04-27: Parseval des ChĂȘnes, Marc-Antoine († 1836-08-16, 81 yrs.).

 
 
Valid HTML 4.01! IST http://web.ist.utl.pt/~ist11038/compute/or/Fx-filled_cplexLP.php
Created: 2016-04-27 — Last modified: 2021-07-12