An algorithm using Lagrangean relaxation and decomposition for solving a capacitated lot-sizing problem

DOI10.1504/IJMOR.2010.030817zbMath1183.90056MaRDI QIDQ961468

Ka-Yun Yip, Manohar S. Madan, Angappa Gunasekaran, Chun Hung Cheng

Publication date: 30 March 2010

Published in: International Journal of Mathematics in Operational Research (Search for Journal in Brave)

zbMATH Keywords

Lagrangean relaxationproduction planningcapacitated lot-sizingmanufacturing industryCLS problemdecomposition schemessub-gradient optimisation

Mathematics Subject Classification ID

Linear programming (90C05) Transportation, logistics and supply chain management (90B06)

This page was built for publication: An algorithm using Lagrangean relaxation and decomposition for solving a capacitated lot-sizing problem