A Note on the Assortment Problem

Charles R. Frank, Jr.
Additional contact information
Charles R. Frank, Jr.: East African Institute of Social Research and Makerere University College, Kampala, Uganda

Management Science, 1965, vol. 11, issue 7, 724-726

Abstract: Wieslaw Sadowski [Sadowski, W. 1959. A few remarks on the assortment problem. Management Sci. 6 (1, October).] has proposed a dynamic programming approach to the solution of the assortment problem by showing its equivalence to the shortest route problem and using Bellman's algorithm [Bellman, R. 1957. Dynamic Programming. Princeton, University Press, New Jersey.]. In this paper we offer an alternative solution which solves a slightly more general problem and prove a theorem which greatly reduces the amount of computation necessary to arrive at a solution.

Date: 1965
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.11.7.724 (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:11:y:1965:i:7:p:724-726

Access Statistics for this article

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