Précis--Stability of the Dual Cutting-Plane Algorithm for Concave Programming

B. L. Fox
Additional contact information
B. L. Fox: The RAND Corporation

Management Science, 1972, vol. 18, issue 6, B357-B358

Abstract: In the column generating approach to concave programming, alias the dual cutting-plane algorithm (Zangwill), Lagrangians are maximized to generate columns. Often this cannot be done in a finite number of steps. We show what to do.

Date: 1972
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.18.6.B357 (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:ormnsc:v:18:y:1972:i:6:p:b357-b358

Access Statistics for this article

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