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

Jonathan H. Owen () and Sanjay Mehrotra ()
Additional contact information
Jonathan H. Owen: General Motors Research and Development Center, 30500 Mound Road, MC #480-106-359, Warren, Michigan 48090
Sanjay Mehrotra: Department of Industrial Engineering and Management Sciences, Robert R. McCormick School of Engineering, Northwestern University, Evanston, Illinois 60208

Operations Research, 2002, vol. 50, issue 5, 810-819

Abstract: 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.

Keywords: Programming; integer: remodeling of general integer variables (search for similar items in EconPapers)
Date: 2002
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.50.5.810.370 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:50:y:2002:i:5:p:810-819

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().