Bounded Production and Inventory Models with Piecewise Concave Costs

Stephen F. Love
Additional contact information
Stephen F. Love: Oregon State University

Management Science, 1973, vol. 20, issue 3, 313-318

Abstract: An n period single-product single-facility model with known requirements and separable piecewise concave production and storage costs is considered. It is shown using network flow concepts that for arbitrary bounds on production and inventory in each period there is an optimal schedule such that if, for any two periods, production does not equal zero or its upper or lower bound, then the inventory level in some intermediate period equals zero or its upper or lower bound. An algorithm for searching such schedules for an optimal one is given where the bounds on production are -\infty , 0 or \infty . A more efficient algorithm assumes further that inventory bounds satisfy "exact requirements."

Date: 1973
References: Add references at CitEc
Citations: View citations in EconPapers (49)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.20.3.313 (application/pdf)

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:inm:ormnsc:v:20:y:1973:i:3:p:313-318

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().