Advanced preprocessing techniques for linear and quadratic programming

OR Spectrum

Volumn 25, Issue 4, 2003, Pages 575-595

  Meszaros Cs ^a   Suhl, U H ^b  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Linear programming; Presolve; Simplex and interior point methods

Indexed keywords

EID: 1442280698     PISSN: 01716468     EISSN: 14366304     Source Type: Journal    
DOI: 10.1007/s00291-003-0130-x     Document Type: Article

References (23)

1. Andersen ED (1995) Finding all linearly dependent rows in large-scale linear programming. Optimization Methods and Software 6: 219-227
2. Andersen ED, Andersen KD (1995) Presolving in linear programming. Math Programming 71(1): 221-245
3. Andersen ED, Gondzio J, Mészáros Cs, Xu X (1996) Implementation of interior point methods for large scale linear programs. In: Terlaky T (ed) Interior point methods of mathematical programming, pp 189-252. Kluwer, Amsterdam
4. Brearley AL, Mitra G, Williams HP (1975) Analysis of mathematical programming problems prior to applying the simplex algorithm. Mathematical Programming 15: 54-83
5. Chang SF, McCormick ST (1992) A hierarchical algorithm for making sparse matrices sparse. Mathematical Programming 56: 1-30
6. Dietrich BL, Escudero LF, Chance F (1993) Efficient reformulation for 0-1 programs - methods and computational results. Discrete Applied Mathematics 42: 147-175
7. Forrest JJH, Tomlin JA (1992) Implementing the simplex method for optimization subroutine library. IBM Systems Journal 31(1): 11-25
8. Gay DM (1985) Electronic mail distribution of linear programming test problems. COAL Newsletter 13: 10-12
9. Gondzio J (1997) Presolve analysis of linear programs prior to applying the interior point method. INFORMS Journal on Computing 9(1): 73-91
10. Hoffman KL, Padberg M (1991) Improving LP-representations of zero-one linear programs for branch-and-cut. ORSA Journal on Computing 3: 121-134
11. Karwan MH, Lotfi V, Telgen J, Zionts S (1983) Redundancy in Mathematical Programming. Springe, Berlin Heidelberg New York
12. Markowitz HM (1956) The optimization of a quadratic function subject to linear constraints. Naval Research Logistic Quarterly 3: 111-133
13. Maros I, Mészáros Cs (1998) The role of the augmented system in interior point methods. European Journal on Operational Research 107(3): 720-736
14. Mészáros Cs (1996) Fast Cholesky factorization for interior point methods of linear programming. Computers & Mathematics with Applications 31(4/5): 49-54
15. Mészáros Cs (1998) On the sparsity issues of interior point methods for quadratic programming. Working paper WP 98-4, Computer and Automation Institute, Hungarian Academy of Sciences, Budapest
16. Mészáros Cs (1998) Ordering heuristics in interior point LP methods. In: Gianessi F, Komlósi S, Rapcsák T (eds) New trends in mathematical programming, pp 203-221. Kluwer, Amsterdam
17. Mészáros Cs (1999) BPMPD Home Page. World Wide Web, http://www.sztaki.hu/̃meszaros/bpmpd
18. Mészáros Cs (1999) The BPMPD interior-point solver for convex quadratic problems. Optimization Methods and Software 11&12: 431-449
19. Mészáros Cs, Gondzio J (2001) Addendum to "Presolve analysis of linear programs prior to applying an interior point method". Informs Journal on Computing 13(2): 169-170
20. Mittelmann HD (1999) Benchmarking interior point LP/QP solvers. Optimization Methods and Software (12): 655-670
21. Suhl UH (1994) MOPS - Mathematical Optimization System. European Journal of Operational Research 72: 312-322
22. Suhl UH (1999) MOPS Home Page. World Wide Web, http://www.mops-optimizer.com/
23. Suhl UH, Szymanski R (1991) Supernode processing of mixed-integer models. Computational Optimization and Applications 3: 317-331