The Assortment Problem with Probabilistic Demands

David W. Pentico
Additional contact information
David W. Pentico: University of Pittsburgh

Management Science, 1974, vol. 21, issue 3, 286-290

Abstract: The early work done on the assortment problem assumed known demands and additive and proportional substitution cost functions for single period problems. The extension of this problem (to consider probabilistic demands and multiple periods) complicates the problem considerably. By making some assumptions about the pattern of demands and the form of a reasonable solution, the problem can be approached by using dynamic programming thus finding the shortest route through a network.

Date: 1974
References: Add references at CitEc
Citations: View citations in EconPapers (19)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.21.3.286 (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:21:y:1974:i:3:p:286-290

Access Statistics for this article

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