Preprocessing and probing techniques for mixed integer programming problems. (English) Zbl 0814.90093

Savelsbergh, M. W. P.

ORSA J. Comput. 6, No. 4, 445-454 (1994).

Summary: In the first part of the paper, we present a framework for describing basic techniques to improve the representation of a mixed integer programming problem. We elaborate on identification of infeasibility and redundancy, improvement of bounds and coefficients, and fixing of binary variables. In the second part of the paper, we discuss recent extensions to these basic techniques and elaborate on the investigation and possible uses of logical consequences.

MSC:

90C11

Mixed integer programming

Keywords:

identification of infeasibility and redundancy; improvement of bounds

Software:

MINTO