Abstract.
The paper presents an overview on the preprocessing techniques of linear programming. A new reduction technique is also introduced and the presolve is extended to mixed integer and quadratic programming problems. Numerical results are presented to demonstrate the impact of presolving in interior point and simplex implementations. The demonstrative results are given on large-scale linear, mixed integer and quadratic programming test problems.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Corresponding author
Additional information
Cs. Mészáros: Supported in part by Alexander von Humboldt Foundation
Correspondence to: U.H. Suhl
Rights and permissions
About this article
Cite this article
Mészáros, C., Suhl, U.H. Advanced preprocessing techniques for linear and quadratic programming. OR Spectrum 25, 575–595 (2003). https://doi.org/10.1007/s00291-003-0130-x
Issue Date:
DOI: https://doi.org/10.1007/s00291-003-0130-x