Capacitated procurement planning with price-sensitive demand and general concave-revenue functions

Joseph Geunes, Yasemin Merzifonluoglu and H. Edwin Romeijn

European Journal of Operational Research, 2009, vol. 194, issue 2, 390-405

Abstract: This paper develops effective solution methods for discrete-time, finite-horizon procurement planning problems with economies of scale in procurement, price-sensitive demand, and time-invariant procurement capacities. Our models consider general concave-revenue functions in each time period, and seek to maximize total revenue less procurement and inventory holding costs. We consider the case in which prices may vary dynamically, as well the important practical case in which a constant price is required during the planning horizon. Under mild conditions on the revenue function properties, we provide polynomial-time solution methods for this problem class. The structural properties of optimal solutions that lead to efficient solution methods also serve to sharpen intuition regarding optimal demand management strategies in complex planning situations.

Keywords: Production; Pricing; Inventory (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377-2217(07)01206-4
Full text for ScienceDirect subscribers only

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:eee:ejores:v:194:y:2009:i:2:p:390-405

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().