Skip to main content
Log in

Advanced preprocessing techniques for linear and quadratic programming

  • Original Paper
  • Published:
OR Spectrum Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Cs Mészáros.

Additional information

Cs. Mészáros: Supported in part by Alexander von Humboldt Foundation

Correspondence to: U.H. Suhl

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00291-003-0130-x

Keywords:

Navigation