Results on Preprocessing, Postprocessing and Node Processing in Industrial LP And MIP Models

  • L. Van hamme
  • A. Van Looveren
Conference paper
Part of the Operations Research Proceedings book series (ORP, volume 1993)


OMP, a general solver for industrial LP and MIP models, is based on the simplex and branch and bound algorithms. Performance has been substantially improved through the implementation of various techniques, which reduce the model size and prune the branch and bound tree. Furthermore, the basic algorithms have been made faster, and the choice of branching variables has been sophisticated. The model reduction techniques include variable and constraint elimination and substitution. Pruning of the branch and bound tree is obtained by sharpening variable bounds, applying coefficient reduction to the constraints, and generating cuts.


System Theory Operation Research Research Proceeding Solution Time Variable Bound 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Springer-Verlag Berlin · Heidelberg 1994

Authors and Affiliations

  • L. Van hamme
    • 1
  • A. Van Looveren
    • 1
  1. 1.Beyers Innovative Software BrasschaatBelgium

Personalised recommendations