All‐integer linear programming — a new approach via dynamic programming

Leon Cooper and Mary W. Cooper

Naval Research Logistics Quarterly, 1978, vol. 25, issue 3, 415-429

Abstract: An exact method for solving all‐integer linear‐programming problems is presented. Dynamic‐programming methodology is used to search efficiently candidate hyperplanes for the optimal feasible integer solution. The explosive storage requirements for high‐dimensional dynamic programming are avoided by the development of an analytic representation of the optimal allocation at each stage. Computational results for problems of small to moderate size are also presented.

Date: 1978
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800250305

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:wly:navlog:v:25:y:1978:i:3:p:415-429

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().