A planning horizon algorithm for deterministic inventory management with piecewise linear concave costs

Alain Bensoussan, Jean‐Marie Proth and Maurice Queyranne

Naval Research Logistics (NRL), 1991, vol. 38, issue 5, 729-742

Abstract: We consider a single‐product, discrete‐time production/inventory‐control problem with nonstationary concave nondecreasing costs. Given a forecast horizon K, the problem is to find a decision horizon. We specialize to piecewise linear costs a general approach whereby a problem with horizon K + 1 and arbitrary final demand is parametrically solved. The resulting algorithm is polynomial in the input size.

Date: 1991
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199110)38:53.0.CO;2-U

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:38:y:1991:i:5:p:729-742

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().