A PTAS for capacitated sum-of-ratios optimization
Section snippets
Motivation and introduction
Assortment planning is an important problem facing many retailers and has been studied extensively in the supply chain and operation management literature. Given a limited shelf capacity or inventory investment constraint, the retailer must determine the subset of products to offer that maximizes the total profit. The literature on assortment planning is broad and covers a range of operational issues. A comprehensive review of the literature in this area is given in [1]. The stream of research
Problem formulation
We are given a set of products indexed by . For each product , let and denote its marginal profit (per-unit revenue minus marginal cost) and fixed cost, respectively. The fixed cost of each product might correspond to the cost of introducing the product into the store. We denote the option of no purchase by 0 and set . Given an inventory investment or capacity constraint , we wish to find the subset of products that gives the maximum expected profit.
We will model the
Connection to sum-of-ratios optimization
We will now describe how an approximation algorithm for a sum-of-ratios optimization problem can be used to obtained an approximation for the Assortment problem. For each , let and for each , let . Define a function by: for each , Using a technique pioneered by Megiddo [17], we give an alternative characterization of the optimal profit associated with the Assortment problem.
Lemma 3.1 Parametric Representation is
A PTAS for SOR when is fixed
In this section, we describe a PTAS for the SOR problem when the number of groups is fixed. Let denote the optimal solution associated with with for each and . The main result of this paper is stated in the following theorem.
Theorem 4.1 PTAS For each and with , there exists an approximation algorithm Approx for the SOR problem that will generate an assortment such that for each ,
Acknowledgments
The first author would like to thank Mike Todd for insightful and stimulating discussions on the structure of the linear programs associated with this problem. This research is supported in part by the National Science Foundation through grants DMS-0732196, CMMI-0746844, CMMI-0621433, CCR-0635121, and CMMI-0727640.
References (18)
- et al.
Approximation algorithms for the -dimensional 0–1 knapsack problem: Worst-case and probabilistic analyses
European Journal of Operational Research
(1984) - et al.
Assortment planning: Review of literature and industry practice
- et al.
Discrete Choice Theory of Product Differentiation
(1992) - et al.
Discrete Choice Analysis: Theory and Application to Travel Demand
(1985) - et al.
Retail inventories and consumer choice
Conditional logit analysis of qualitative choice behavior
- et al.
Technical note: Mathematical properties of the optimal product line selection problem using choice-based conjoint analysis
Management Science
(2001) - et al.
Stocking retail assortments under dynamic substitution
Operations Research
(2001) - et al.
On the relationship between inventory costs and variety benefits in retail assortments
Management Science
(1999)
Cited by (37)
Capacitated assortment planning of a multi-location system under transshipments
2022, International Journal of Production EconomicsCitation Excerpt :Kök and Fisher (2007), mentioned above, developed an iterative heuristic algorithm to determine how many items of each product are included in an assortment set when considering shelf-space constraints, allowing for an inventory replenishment system. Rusmevichientong et al. (2009) adopt the nested logit choice model with a budget constraint for a fixed number of products in their assortment problem. In follow-up work, Rusmevichientong et al. (2010) investigate an MNL demand with a cardinality constraint.
Capacitated strategic assortment planning under explicit demand substitution
2021, European Journal of Operational ResearchCitation Excerpt :They reveal that the optimal assortment has a nested structure to allow the products to be simply ranked by quality values and costs; further, the optimal assortment includes the top products in the ranking to fully utilize the capacity. Rusmevichientong, Shen, and Shmoys (2009) address an assortment problem under the nested logit choice model, formulated as an integer-programming problem involving a sum of ratios that reduces to a knapsack problem. The authors provide a polynomial time approximation for the optimization problem with a budget constraint.
A PTAS for a class of binary non-linear programs with low-rank functions
2021, Operations Research LettersCapacitated assortment and price optimization under the multilevel nested logit model
2019, Operations Research LettersOn the sum-product ratio problem and its applications
2016, Operations Research Letters