Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems

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, 1973, vol. 21, issue 1, 156-161

Abstract: This paper gives rules that enable the transformation of a 0-1 polynomial programming problem into a 0-1 linear programming problem to be effected with reduced numbers of constraints. Rules are also given that provide reduced numbers of variables when the true variables of interest are not individual cross-product terms, but sums of such terms or polynomials of the form (∑ x j ) p .

Date: 1973
References: Add references at CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.21.1.156 (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:21:y:1973:i:1:p:156-161

Access Statistics for this article

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