Efficient formulations for pricing under attraction demand models

We propose a modeling and optimization framework to cast a broad range of fundamental multi-product pricing problems as tractable convex optimization problems. We consider a retailer offering an assortment of differentiated substitutable products to a population of customers that are price-sensitive. The retailer selects prices to maximize profits, subject to constraints on sales arising from inventory and capacity availability, market share goals, bounds on allowable prices and other considerations. Consumers’ response to price changes is represented by attraction demand models, which subsume the well known multinomial logit (MNL) and multiplicative competitive interaction demand models. Our approach transforms seemingly non-convex pricing problems (both in the objective function and constraints) into convex optimization problems that can be solved efficiently with commercial software. We establish a condition which ensures that the resulting problem is convex, prove that it can be solved in polynomial time under MNL demand, and show computationally that our new formulations reduce the solution time from days to seconds. We also propose an approximation of demand models with multiple overlapping customer segments, and show that it falls within the class of demand models we are able to solve. Such mixed demand models are highly desirable in practice, but yield a pricing problem which appears computationally challenging to solve exactly.National Science Foundation (U.S.) (grants CMMI-0846554 (CAREER Award) and DMS-0732175)United States. Air Force Office of Scientific Research (awards FA9550-08-1-0369 and FA9550- 08-1-0369)National Science Foundation (U.S.) (Awards CMMI-0758061, EFRI-0735905, and CMMI-0824674)Solomon Buchsbaum AT&T Research FundSingapore-MIT Allianc