Technical Note—Equivalent Mixed Integer Programming Problems

Gordon H. Bradley
Additional contact information
Gordon H. Bradley: Yale University, New Haven, Connecticut

Operations Research, 1973, vol. 21, issue 1, 323-326

Abstract: Every mixed integer programming problem is shown to be equivalent to an infinite number of other mixed integer programming problems. The optimal solution to any problem in a class determines the optimal solution to every other problem in the class. Canonical problems existing in every equivalence class may be solved in lieu of the original problem. For problems with rational data, the mixed Hermite canonical problem is introduced. A numerical example is included.

Date: 1973
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.21.1.323 (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:323-326

Access Statistics for this article

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