A Method for Solving Discrete Optimization Problems

E. L. Lawler and M. D. Bell
Additional contact information
E. L. Lawler: The University of Michigan, Ann Arbor, Michigan
M. D. Bell: The University of Michigan, Ann Arbor, Michigan

Operations Research, 1966, vol. 14, issue 6, 1098-1112

Abstract: This paper describes a simple, easily-programmed method for solving discrete optimization problems with monotone objective functions and completely arbitrary (possibly nonconvex) constraints. The method is essentially one of partial enumeration, and is closely related to the “lexicographic” algorithm of Gilmore and Gomory for the “knapsack” problem and to the “additive” algorithm of Balas for the general integer linear programming problem. The results of a number of sample computations are reported. These indicate that the method is computationally feasible for problems in which the number of variables is fairly small.

Date: 1966
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.14.6.1098 (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:14:y:1966:i:6:p:1098-1112

Access Statistics for this article

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