Kybernetika 46 no. 3, 415-422, 2010

The Single (and Multi) Item profit maximizing capacitated lot-size (PCLSP) problem with fixed prices and no set-up

Kjetil K. Haugen, Asmund Olstad, Krystsina Bakhrankova and Erik Van Eikenhorst


This paper proposes a specialized LP-algorithm for a sub problem arising in simple Profit maximising Lot-sizing. The setting involves a single (and multi) item production system with negligible set-up costs/times and limited production capacity. The producer faces a monopolistic market with given time-varying linear demand curves.


heuristics, lot-sizing, dynamic pricing, specialized algorithm for LP's


65K05, 90B30, 68W99