Nonlinear Phenomena in Complex Systems, 2003, Vol.6, No.3, pp.752-756

NONLINEAR PHENOMENA IN COMPLEX SYSTEMS
An Interdisciplinary Journal

2003, Vol.6, No.3, pp.752-756

Decomposition Algorithm for Lot-Sizing Problems of Optimization
L. I. Minchenko, V. N. Kulaga, A. N. Tarakanov

Lot-sizing and scheduling problems are classical problems, with many published papers presenting a number of results (see e.g.[1]-[4]). The considered problems display many variations and situations, and there are numerous methods and algorithms for solving or improving the models. This paper presents an approach that can be used to get a good lower bound and in some cases a feasible solution of the Multi-Item Capacitated Lot-Sizing Problem (MCLP) via application of decomposition and a nonsmooth optimization algorithm.
Key words: nonsmooth optimization, large scale, decomposition

Full text: Acrobat PDF (133KB) PostScript (241KB) PostScript.gz (114KB)