SAA-regularized methods for multiproduct price optimization under the pure characteristics demand model

Utility-based choice models are often used to determine a consumer’s purchase decision among a list of available products; to provide an estimate of product demands; and, when data on purchase decisions or market shares are available, to infer consumers’ preferences over observed product characteristics. These models also serve as a building block in modeling firms’ pricing and assortment optimization problems. We consider a firm’s multiproduct pricing problem, in which product demands are determined by a pure characteristics model. A sample average approximation (SAA) method is used to approximate the expected market share of products and the firm profit. We propose an SAA-regularized method for the multiproduct price optimization problem. We present convergence analysis and numerical examples to show the efficiency and the effectiveness of the proposed method.

[1]  Huseyin Topaloglu,et al.  Constrained Assortment Optimization for the Nested Logit Model , 2014, Manag. Sci..

[2]  Adrian S. Lewis,et al.  Nonsmooth optimization via quasi-Newton methods , 2012, Mathematical Programming.

[3]  Xiaojun Chen,et al.  Newton iterations in implicit time-stepping scheme for differential linear complementarity systems , 2013, Math. Program..

[4]  R. Aumann.  INTEGRALS OF SET-VALUED FUNCTIONS , 1965 .

[5]  Guillermo Gallego,et al.  WORKING PAPER SERIES , 2011 .

[6]  Richard W. Cottle,et al.  Linear Complementarity Problem. , 1992 .

[7]  Bastian Goldlücke,et al.  Variational Analysis , 2014, Computer Vision, A Reference Guide.

[8]  Alexander Shapiro,et al.  Convex Approximations of Chance Constrained Programs , 2006, SIAM J. Optim..

[9]  P. Rusmevichientong,et al.  Assortment Optimization under the Multinomial Logit Model with Random Choice Parameters , 2014 .

[10]  R. Rockafellar,et al.  Optimization of conditional value-at risk , 2000 .

[11]  Michael A. Saunders,et al.  SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization , 2002, SIAM J. Optim..

[12]  F. Facchinei,et al.  Finite-Dimensional Variational Inequalities and Complementarity Problems , 2003 .

[13]  Guang Li,et al.  The d-Level Nested Logit Model: Assortment and Price Optimization Problems , 2015, Oper. Res..

[14]  Alexander Shapiro,et al.  Differentiability and semismoothness properties of integral functions and their applications , 2005, Math. Program..

[15]  J. Aubin.  Set-valued analysis , 1990 .

[16]  Jeremy T. Fox,et al.  Improving the Numerical Performance of Static and Dynamic Aggregate Discrete Choice Random Coefficients Demand Estimation by Jean-pierre Dubé, , 2012 .

[17]  John M. Wilson,et al.  Introduction to Stochastic Programming , 1998, J. Oper. Res. Soc..

[18]  Steven Berry,et al.  The Pure Characteristics Demand Model , 2007 .

[19]  Vladimir Shikhman.  Topological Aspects of Nonsmooth Optimization , 2011 .

[20]  Benjamin Pfaff,et al.  Perturbation Analysis Of Optimization Problems , 2016 .

[21]  Adrian S. Lewis,et al.  A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization , 2005, SIAM J. Optim..

[22]  Huifu Xu.  Uniform exponential convergence of sample average random functions under general sampling with applications in stochastic programming , 2010 .

[23]  Huseyin Topaloglu,et al.  Assortment Optimization Under Variants of the Nested Logit Model , 2014, Oper. Res..

[24]  Jong-Shi Pang,et al.  A Constructive Approach to Estimating Pure Characteristics Demand Models with Pricing , 2015, Oper. Res..

[25]  Xiaojun Chen,et al.  Regularized Mathematical Programs with Stochastic Equilibrium Constraints: Estimating Structural Demand Models , 2015, SIAM J. Optim..

[26]  George L. Nemhauser,et al.  Handbooks in operations research and management science , 1989 .

[27]  F. Clarke.  Optimization And Nonsmooth Analysis , 1983 .

[28]  Bethany L. Nicholson,et al.  Mathematical Programs with Equilibrium Constraints , 2021, Pyomo — Optimization Modeling in Python.

[29]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .

[30]  Xiaojun Chen,et al.  Perturbation Bounds of P-Matrix Linear Complementarity Problems , 2007, SIAM J. Optim..

[31]  Fanwen Meng,et al.  A Regularized Sample Average Approximation Method for Stochastic Mathematical Programs with Nonsmooth Equality Constraints , 2006, SIAM J. Optim..

[32]  Marc Quincampoix,et al.  Parameterized Minimax Problem: On Lipschitz-Like Dependence of the Solution with Respect to the Parameter , 2008, SIAM J. Optim..