Presolving in linear programming
| Autor: | Andersen, Erling D., Andersen, Knud D. |
|---|---|
| Zdroj: | Mathematical Programming; December 1995, Vol. 71 Issue: 2 p221-245, 25p |
| Abstrakt: | Most modern linear programming solvers analyze the LP problem before submitting it to optimization. Some examples are the solvers WHIZARD (Tomlin and Welch, 1983), OB1 (Lustig et al., 1994), OSL (Forrest and Tomlin, 1992), Sciconic (1990) and CPLEX (Bixby, 1994). The purpose of the presolve phase is to reduce the problem size and to discover whether the problem is unbounded or infeasible. |
| Databáze: | Supplemental Index |
| Externí odkaz: |
|
Full text from SpringerLink