Improved Linear Integer Programming Formulations of Nonlinear Integer Problems

Fred Glover
Additional contact information
Fred Glover: University of Colorado

Management Science, 1975, vol. 22, issue 4, 455-460

Abstract: A variety of combinatorial problems (e.g., in capital budgeting, scheduling, allocation) can be expressed as a linear integer programming problem. However, the standard devices for doing this often produce an inordinate number of variables and constraints, putting the problem beyond the practical reach of available integer programming methods. This paper presents new formulation techniques for capturing the essential nonlinearities of the problem of interest, while producing a significantly smaller problem size than the standard techniques.

Date: 1975
References: Add references at CitEc
Citations: View citations in EconPapers (123)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.22.4.455 (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:ormnsc:v:22:y:1975:i:4:p:455-460

Access Statistics for this article

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