Abstract
The assortment problem was introduced for decision-makers to select optimal production configurations to stock or manufacture. Early work on this topic assumed either linear cost functions or concave manufacturing costs with additive, proportional substitution costs. This paper extends the analysis to more general concave cost functions. Sufficient conditions for the existence of an optimal segmented policy are investigated. A dynamic programming algorithm for an optimal assortment is also included.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
