There Cannot be any Algorithm for Integer Programming with Quadratic Constraints

R. C. Jeroslow
Additional contact information
R. C. Jeroslow: Carnegie-Mellon University, Pittsburgh, Pennsylvania

Operations Research, 1973, vol. 21, issue 1, 221-224

Abstract: This paper studies a class of integer programming problems in which squares of variables may occur in the constraints, and shows that no computing device can be programmed to compute the optimum criterion value for all problems in this class.

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

Downloads: (external link)
http://dx.doi.org/10.1287/opre.21.1.221 (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:221-224

Access Statistics for this article

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