Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems

Warren P. Adams and Hanif D. Sherali
Additional contact information
Warren P. Adams: Clemson University, Clemson, South Carolina
Hanif D. Sherali: Virginia Polytechnic Institute and State University, Blacksburg, Virginia

Operations Research, 1990, vol. 38, issue 2, 217-226

Abstract: This paper is concerned with a new linearization strategy for a class of zero-one mixed integer programming problems that contains quadratic cross-product terms between continuous and binary variables, and between the binary variables themselves. This linearization scheme provides an equivalent mixed integer linear programming problem which yields a tighter continuous relaxation than that obtainable via the alternative linearization techniques available in the literature. Moreover, the proposed technique provides a unifying framework in the sense that all the alternate methods lead to formulations that are accessible through appropriate surrogates of the constraints of the new linearized formulation. Extensions to various other types of mixed integer nonlinear programming problems are also discussed.

Keywords: programming: linear reformulations of nonlinear integer programs; programming; integer; nonlinear: mixed integer programming problems (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations: View citations in EconPapers (30)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.38.2.217 (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:38:y:1990:i:2:p:217-226

Access Statistics for this article

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