Algorithm for turnpike policies in the dynamic lot size model

Volume 24 / 1996

Stanisław Bylka Applicationes Mathematicae 24 (1996), 57-75 DOI: 10.4064/am-24-1-57-75


This article considers optimization problems in a capacitated lot sizing model with limited backlogging. Nothing is assumed about the cost function in the case of finite restrictions of the size on the stock and backlogs. The holding and backlogging costs are functions assumed to be stationary or nearly stationary in time. In both cases, it is shown that there exists an optimal infinite inverse policy and a periodical turnpike policy. Some forward and backward procedures are adopted that determine an optimal infinite inverse policy and a strong turnpike policy relative to the class of standard or batch ordering type policies. Some remarks on the existence of planning and forecast horizons are also given.


  • Stanisław Bylka

Search for IMPAN publications

Query phrase too short. Type at least 4 characters.

Rewrite code from the image

Reload image

Reload image