Abstract
The solution strategy known as the column generation principle—and its dual counterpart, constraint generation—is one of the standard tools of mathematical programming. Since the pioneering work on the maximum multi-commodity network flow problem by Ford and Fulkerson [FoF58, FoF62] in the late 50’s, column generation methods have been developed and applied in a variety of contexts. With no doubt, the most famous column generation method is the Dantzig-Wolfe decomposition method for specially structured linear programs ([DaW60, DaW61]), in which the column generation is based on the pricingout mechanism of the simplex method. [Another famous column generation technique is the one for cutting stock problems, where the column generation is based on the solution of knapsack problems ([GiG61, GiG63, GiG65]).]
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Patriksson, M. (1999). A column generation / simplicial decomposition algorithm. In: Nonlinear Programming and Variational Inequality Problems. Applied Optimization, vol 23. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2991-7_9
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2991-7_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4806-9
Online ISBN: 978-1-4757-2991-7
eBook Packages: Springer Book Archive