Solution of the Lorie-Savage and Similar Integer Programming Problems by the Generalized Lagrange Multiplier Method

Seymour Kaplan
Additional contact information
Seymour Kaplan: New York University, New York

Operations Research, 1966, vol. 14, issue 6, 1130-1136

Abstract: A specific type of all-integer integer programming problem which seems to arise frequently in capital budgeting and other areas involves a zero-one restriction on the problem variables. Approaches to solutions to such problems by the General Lagrange Multiplier Method are discussed. This procedure, because of its relative simplicity, has certain advantages over other direct methods such as the use of integer programming algorithms, especially in areas such as capital budgeting where the constraints are usually not binding to the degree indicated by the problem statement. Throughout this paper, the Lorie-Savage problem in capital budgeting is used as a basis for the discussion.

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

Downloads: (external link)
http://dx.doi.org/10.1287/opre.14.6.1130 (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:1130-1136

Access Statistics for this article

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