Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program

Fred Glover and Eugene Woolsey
Additional contact information
Fred Glover: University of Colorado, Boulder, Colorado
Eugene Woolsey: Colorado School of Mines, Golden, Colorado

Operations Research, 1974, vol. 22, issue 1, 180-182

Abstract: Rules are given that permit 0-1 polynomial programming problems to be converted to 0-1 linear programming problems in a manner that replaces cross-product terms by continuous rather than integer variables. Since the difficulty of mixed integer programming problems often depends more strongly on the number of integer variables than on the number of continuous variables, such rules are expected to have advantages in practical applications. In addition, the continuous variables automatically receive integer values, and hence our formulation can also be exploited by methods designed to take advantage of a pure integer structure.

Date: 1974
References: Add references at CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.22.1.180 (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:22:y:1974:i:1:p:180-182

Access Statistics for this article

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