Acceleration of Lagrangian Column-Generation Algorithms by Penalty Function Methods

Richard P. O'Neill and William B. Widhelm
Additional contact information
Richard P. O'Neill: Louisiana State University
William B. Widhelm: University of Maryland

Management Science, 1976, vol. 23, issue 1, 50-58

Abstract: A Lagrangian column-generation procedure is developed which retains the original problem functions for column generation but uses transformed penalty functions in the Lagrangian optimization. The class of penalty functions considered maintains the original order of differentiability and often enhances the optimization operation. Convergence is proven for convex problems and limited computational experience cited where the new procedure converges two to four times faster than the standard method. Certain modifications of these techniques to attack nonconvex problems are also presented.

Date: 1976
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.23.1.50 (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:23:y:1976:i:1:p:50-58

Access Statistics for this article

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