Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- 1 December 1975
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 22 (4) , 455-460
- https://doi.org/10.1287/mnsc.22.4.455
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.Keywords
This publication has 0 references indexed in Scilit: