A technique that permits solution of very large linear-programming problems by generating the columns of the constraint matrix only when they are needed. It is typically employed when the constraint matrix is too large to be stored, or when it is only known implicitly. Column generation, as imbedded in the revised simplex method, has been used to solve the trim problem and other such problems in which the columns are formed from combinatorial considerations. See Trim problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Kluwer Academic Publishers
About this entry
Cite this entry
Gass, S.I., Harris, C.M. (2001). Column generation . In: Gass, S.I., Harris, C.M. (eds) Encyclopedia of Operations Research and Management Science. Springer, New York, NY. https://doi.org/10.1007/1-4020-0611-X_125
Download citation
DOI: https://doi.org/10.1007/1-4020-0611-X_125
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-7923-7827-3
Online ISBN: 978-1-4020-0611-1
eBook Packages: Springer Book Archive