Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition

R. Kipp Martin
Additional contact information
R. Kipp Martin: University of Chicago, Chicago, Illinois

Operations Research, 1987, vol. 35, issue 6, 820-831

Abstract: Dropping the “complicating” constraints in a mixed-integer linear program often yields a “special structure subproblem” that can be reformulated using a different set of decision variables. Once the new variables have been identified, the entire problem can be reformulated in terms of the new variables. We develop a theory of variable redefinition based on relating the two sets of decision variables by a linear transformation, and describe methods for reformulating the special structure problem. The reformulated models have a more accurate linear relaxation than the problems from which they were derived, an important property within the context of linear programming-based branch-and-bound modeling approaches.

Keywords: 630 LP-based branch-and-bound; 639 theory of variable redefinition (search for similar items in EconPapers)
Date: 1987
References: Add references at CitEc
Citations: View citations in EconPapers (16)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.35.6.820 (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:35:y:1987:i:6:p:820-831

Access Statistics for this article

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