Abstract
We study the capacitated assortment and price optimization problem, where a retailer sells categories of substitutable products subject to a capacity constraint. The goal of the retailer is to determine the subset of products as well as their selling prices so as to maximize the expected revenue. We model the customer purchase behavior using the nested logit model and formulate this problem as a non-linear binary integer program. For this NP-complete problem, we show that there exists a pseudo polynomial time approximation scheme that finds its \(\epsilon \)-approximate solution. We first convert the original problem into an equivalent fixed point problem. We then show that finding an \(\epsilon \)-approximate solution to the fixed point problem can be achieved by binary search, where a non-linear auxiliary problem is repeatedly approximated by a dynamic programing based algorithm involving an approximation to a series of multiple-choice parametric knapsack problems. For the special case when the capacity constraints are cardinal and nest-specific, we develop an algorithm that finds the optimal solution in strongly polynomial time. Moreover, our algorithm can be directly applied to find an \(\epsilon \)-approximate solution to the capacitated assortment optimization problem under the nested logit model, which is the first approximate algorithm that is polynomial with respect to the number of nests in the literature.
Similar content being viewed by others
References
Agrawal, S., Avadhanula, V., Goyal, V., Zeevi, A.: Mnl-bandit: a dynamic learning approach to assortment selection. Working paper (2017)
Agrawal, S., Avadhanula, V., Goyal, V., Zeevi, A.: Thompson sampling for the mnl-bandit. In: Proccedings of the Conference on Learning Theory (2017)
Alptekinoğlu, A., Semple, J.H.: The exponomial choice model: a new alternative for assortment and price optimization. Oper. Res. 64(1), 79–93 (2016)
Anderson, E.T., Simester, D.I.: Effects of \$9 price endings on retail sales: evidence from field experiments. Quant. Mark. Econ. 1(1), 93–110 (2003)
Aouad, A., Levi, R., Segev, D.: Greedy-like algorithms for dynamic assortment planning under multinomial logit preferences. Oper. Res. 66(5), 1321–1345 (2018)
Ben-Akiva, M.E., Lerman, S.R.: Discrete Choice Analysis: Theory and Application to Travel Demand. MIT Press, Cambridge (1985)
Besbes, O., Sauré, D.: Product assortment and price competition under multinomial logit demand. Prod. Oper. Manag. 25(1), 114–127 (2016)
Chen, K.D., Hausman, W.H.: Technical note: Mathematical properties of the optimal product line selection problem using choice-based conjoint analysis. Manag. Sci. 46(2), 327–332 (2000)
Chen, R., Jiang, H.: Assortment optimization with position effects under the nested logit model. Working paper (2017)
Chen, R., Jiang, H.: Capacitated assortment and price optimization for customers with disjoint consideration sets. Oper. Res. Lett. 45(2), 170–174 (2017)
Chen, R., Jiang, H.: Capacitated assortment and price optimization under the multilevel nested logit model. Oper. Res. Lett. 47(1), 30–35 (2019)
Chen, X., Wang, Y., Zhou, Y.: Dynamic assortment selection under the nested logit models. Working paper (2018)
Davis, J., Gallego, G., Topaloglu, H.: Assortment planning under the multinomial logit model with totally unimodular constraint structures. Working paper (2013)
Davis, J.M., Gallego, G., Topaloglu, H.: Assortment optimization under variants of the nested logit model. Oper. Res. 62(2), 250–273 (2014)
Davis, J.M., Topaloglu, H., Williamson, D.P.: Pricing problems under the nested logit model with a quality consistency constraint. INFORMS J. Comput. 29(1), 54–76 (2017)
Désir, A., Goyal, V.: Near-optimal algorithms for capacity constrained assortment optimization. Working paper (2014)
Dong, L.X., Kouvelis, P., Tian, Z.J.: Dynamic pricing and inventory control of substitute products. Manuf. Serv. Oper. Manag. 11(2), 317–339 (2009)
Feldman, J., Zhang, D., Liu, X., Zhang, N.: Taking assortment optimization from theory to practice: evidence from large field experiments on Alibaba. Working paper (2018)
Feldman, J.B., Topaloglu, H.: Capacity constraints across nests in assortment optimization under the nested logit model. Oper. Res. 63(4), 812–822 (2015)
Gallego, G., Topaloglu, H.: Constrained assortment optimization for the nested logit model. Manag. Sci. 60(10), 2583–2601 (2014)
Gallego, G., Wang, R.: Multiproduct price optimization and competition under the nested logit model with product-differentiated price sensitivities. Oper. Res. 62(2), 450–461 (2014)
Grigolon, L., Verboven, F.: Nested logit or random coefficients logit? A comparison of alternative discrete choice models of product differentiation. Rev. Econ. Stat. 96(5), 916–935 (2014)
Hopp, W.J., Xu, X.: Product line selection and pricing with modularity in design. Manuf. Serv. Oper. Manag. 7(3), 172–187 (2005)
Huh, W.T., Li, H.: Technical note: Pricing under the nested attraction model with a multistage choice structure. Oper. Res. 63(4), 840–850 (2015)
Jagabathula, S., Rusmevichientong, P.: A nonparametric joint assortment and price choice model. Manag. Sci. 63(9), 3128–3145 (2016)
Jiang, H., Chen, R., Sun, H.: Multiproduct price optimization under the multilevel nested logit model. Ann. Oper. Res. 254(1–2), 131–164 (2017)
Karmarkar, N.: A new polynomial-time algorithm for linear programming. Combinatorica 4, 373–395 (1984)
Keller, P.W., Levi, R., Perakis, G.: Efficient formulations for pricing under attraction demand models. Math. Program. 145(1–2), 223–261 (2014)
Kleinberg, J., Tardos, E.: Algorithm Design. Pearson Education India, Bangalore (2006)
Kök, A.G., Fisher, M.L., Vaidyanathan, R.: Assortment planning: review of literature and industry practice. In: Agrawal, N., Smith, S. (eds.) Retail Supply Chain Management, pp. 99–153. Springer, Boston, MA (2009)
Kök, A.G., Xu, Y.: Optimal and competitive assortments with endogenous pricing under hierarchical consumer choice models. Manag. Sci. 57(9), 1546–1563 (2011)
Li, G., Rusmevichientong, P.: A greedy algorithm for the two-level nested logit model. Oper. Res. Lett. 42(5), 319–324 (2014)
Li, G., Rusmevichientong, P., Topaloglu, H.: The d-level nested logit model: assortment and price optimization problems. Oper. Res. 62(2), 325–342 (2015)
Li, H.M., Huh, W.T.: Pricing multiple products with the multinomial logit and nested logit models: concavity and implications. Manuf. Serv. Oper. Manag. 13(4), 549–563 (2011)
Liu, Q., Van Ryzin, G.: On the choice-based linear programming model for network revenue management. Manuf. Serv. Oper. Manag. 10(2), 288–310 (2008)
Mittal, S., Schulz, A.S.: A general framework for designing approximation schemes for combinatorial optimization problems with many objectives combined into one. Oper. Res. 61(2), 386–397 (2013)
Papadimitriou, C.H., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: 2000. Proceedings. 41st Annual Symposium on Foundations of Computer Science, pp. 86–92. IEEE (2000)
Rayfield, W.Z., Rusmevichientong, P., Topaloglu, H.: Approximation methods for pricing problems under the nested logit model with price bounds. Inf. J. Comput. 27(2), 335–357 (2015)
Rusmevichientong, P., Shen, Z.J.M., Shmoys, D.B.: A ptas for capacitated sum-of-ratios optimization. Oper. Res. Lett. 37(4), 230–238 (2009)
Rusmevichientong, P., Shen, Z.J.M., Shmoys, D.B.: Dynamic assortment optimization with a multinomial logit choice model and capacity constraint. Oper. Res. 58(6), 1666–1680 (2010)
Schindler, R.M., Kibarian, T.M.: Increased consumer sales response though use of 99-ending prices. J. Retail. 72(2), 187–199 (1996)
Talluri, K., Van Ryzin, G.: Revenue management under a general discrete choice model of consumer behavior. Manag. Sci. 50(1), 15–33 (2004)
Train, K.E.: Discrete Choice Methods with Simulation. Cambridge University Press, Cambridge (2009)
Wang, R.X.: Capacitated assortment and price optimization under the multinomial logit model. Oper. Res. Lett. 40(6), 492–497 (2012)
Williams, H.C.: On the formation of travel demand models and economic evaluation measures of user benefit. Environ. Plan. A 9(3), 285–344 (1977)
Xie, T., Ge, D.: A tractable discrete fractional programming: application to constrained assortment optimization. J. Comb. Optim. 36(2), 400–415 (2018)
Acknowledgements
The authors are very grateful to the anonymous referees whose thoughtful comments and constructive suggestions have allowed them to improve the quality of this paper. This research is supported by the Natural Science Foundation of China [Grant 71622006, 71761137003] and the Center for Data-Centric Management in the Department of Industrial Engineering at Tsinghua University.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendices
Appendix A: Heuristic algorithm for a lower bound
In this section, we present a tractable way to obtain a lower bound for \(z^*\) using a marginal-contribution maximization heuristic algorithm, which is described in Algorithm 4 and works repeatedly. In line 1, we let \(\widehat{z}\) be a temporary lower bound, b be the unoccupied capacity and initialize them to zero and c, respectively. In line 2, we introduce \(\varvec{S}\) as the current assortment and \(\overline{\varvec{S}}\) as the set of products that have not been offered in current assortment. In lines 3–11, we check whether there exist a feasible product in \(\overline{\varvec{S}}\) that has positive ratio of marginal contribution and its weight. If this is true, we add the one with maximum marginal-contribution per unit weight to the current assortment and delete the product from \(\overline{\varvec{S}}\) in line 6, then we update \(\widehat{z}\) and the unoccupied capacity in line 7. Otherwise, we terminate the procedure in line 9 and output \(\widehat{z}\) as the lower bound for \(z^*\) in line 12. Note that in each iteration, the unoccupied capacity may reduce by the weight of one product, which is more than one, or remain the same, which means terminating the procedure. So the complexity of Algorithm 4 is bounded by O(cmnd). We remark that for non-degenerate cases with \(c\ge \min _{i\in M, j\in N_i} \left\{ w_{ij}\right\} \), the output \(\widehat{z}\) must be greater than zero.
Appendix B: Notation
In this section, we summarize key notation used throughout the paper for ease of reading:
- M:
-
\(=\{1,2,\ldots , m\}\), the set of nests under the nested logit model.
- \(N_i\):
-
\(\{1,2,\ldots , n_i\}\), the set of products under nest \(i\in M\).
- n:
-
Maximum products under each nest.
- \(\langle i,j\rangle \):
-
Product \(j\in N_i\) under nest \(i\in M\).
- D:
-
\(=\{1,2,\ldots , d\}\)., the set of pre-determined price levels for products.
- \(p_{ijk}\):
-
Price of product \(\langle i,j\rangle \) at level \(k\in D\).
- \(w_{ij}\):
-
Weight of product \(\langle i,j\rangle \),
- c:
-
Capacity limit for all offered products.
- U:
-
The ratio between the maximum and the minimum preference weights of the products.
- \(S_{ijk}\):
-
Binary variable to indicate whether product \(\langle i,j\rangle \) at level \(k\in D\) is offered.
- \(v_{ijk}\):
-
Preference weight for product \(\langle i,j\rangle \) at level \(k\in D\).
- \(\gamma _i\):
-
Scale parameter for nest i.
- \(\varvec{S}\):
-
\(=(\varvec{S}_1, \varvec{S}_2,\ldots ,\varvec{S}_m)\), the set of all decision variables.
- \(V_i(\varvec{S}_i)\):
-
Total preference weights of products under nest i.
- \(R_i(\varvec{S}_i)\):
-
Expected revenue under nest i with assortment \(\varvec{S}_i\).
- \(F(z,\varvec{S}), \mathcal {F}(z)\):
- \(\mathcal {A}_i(z,b_i)\):
-
Collection of candidate assortment associated with nest i with \(b_i\) unit capacity and known z.
Rights and permissions
About this article
Cite this article
Chen, R., Jiang, H. Capacitated assortment and price optimization under the nested logit model. J Glob Optim 77, 895–918 (2020). https://doi.org/10.1007/s10898-020-00896-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-020-00896-x