On the Value of Binary Expansions for General Mixed-Integer Linear Programs

We study the use of binary variables in reformulating general mixed-integer linear programs. We show that binary reformulations result in problems for which almost all the binary variables replacing a general integer variable need to be explored during branching. We also give computational results o...

Full description

Saved in:
Bibliographic Details
Published inOperations research Vol. 50; no. 5; pp. 810 - 819
Main Authors Owen, Jonathan H, Mehrotra, Sanjay
Format Journal Article
LanguageEnglish
Published Linthicum INFORMS 01.09.2002
Institute for Operations Research and the Management Sciences
Subjects
Aircraft hulls
Algorithms
Discrete mathematics
Index sets
Industrial engineering
Integer programming
Integers
Libraries
Linear programming
Mathematical programming
Operations research
Optimization
Perceptron convergence procedure
Polyhedrons
Programming, integer: remodeling of general integer variables
Renovations
Studies
Variables
Online AccessGet full text

Cover

More Information
Summary:We study the use of binary variables in reformulating general mixed-integer linear programs. We show that binary reformulations result in problems for which almost all the binary variables replacing a general integer variable need to be explored during branching. We also give computational results on the performance of such reformulations in solving the mixed-integer programs, which support our theoretical results.
ISSN:0030-364X
1526-5463
DOI:10.1287/opre.50.5.810.370