A Modified Linear Program for Columnar Methods in Mathematical Programming

G. L. Nemhauser and W. B. Widhelm
Additional contact information
G. L. Nemhauser: Cornell University, Ithaca, New York
W. B. Widhelm: University of Maryland, College Park, Maryland

Operations Research, 1971, vol. 19, issue 4, 1051-1060

Abstract: This paper develops a modified linear programming algorithm for columnar methods in mathematical programming that is applicable to the decomposition principle of linear programming, to concave maximization problems over compact and convex sets, and to searching generalized Lagrange multipliers. It derives the linear program from linear inequalities in the multiplier space and compares it with the well-known linear program of Dantzig and Wolfe for solving such problems.

Date: 1971
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.4.1051 (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:19:y:1971:i:4:p:1051-1060

Access Statistics for this article

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