While recent research on assortment planning has yielded many useful analytical results, it has also left many opencomputational questions. In particular, when products are differentiated both horizontally (variety attributes) andvertically (quality attributes) researchers have found that it may be optimal to carry products of mixed quality levels.In such a case the optimal assortment has only been partially characterized. In this paper we use several approachesto find the optimal assortment for specific problem settings. For the make-to-order case we use a variant of theknapsack formulation, while for the make-to-stock case, we find that full enumeration can be used effectively.
展开▼
