Tractable multi-product pricing under discrete choice models
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2013. === Cataloged from PDF version of thesis. === Includes bibliographical references (pages 199-204). === We consider a retailer offering an assortment of differentiated substitutable p...
Main Author: | |
---|---|
Other Authors: | |
Format: | Others |
Language: | English |
Published: |
Massachusetts Institute of Technology
2013
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/82871 |
id |
ndltd-MIT-oai-dspace.mit.edu-1721.1-82871 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-MIT-oai-dspace.mit.edu-1721.1-828712019-05-02T16:20:59Z Tractable multi-product pricing under discrete choice models Keller, Philipp W. (Philipp Wilhelm), 1982- Retsef Levi and Georgia Perakis. Massachusetts Institute of Technology. Operations Research Center. Massachusetts Institute of Technology. Operations Research Center. Operations Research Center. Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2013. Cataloged from PDF version of thesis. Includes bibliographical references (pages 199-204). We consider a retailer offering an assortment of differentiated substitutable products to price-sensitive customers. Prices are chosen to maximize profit, subject to inventory/ capacity constraints, as well as more general constraints. The profit is not even a quasi-concave function of the prices under the basic multinomial logit (MNL) demand model. Linear constraints can induce a non-convex feasible region. Nevertheless, we show how to efficiently solve the pricing problem under three important, more general families of demand models. Generalized attraction (GA) models broaden the range of nonlinear responses to changes in price. We propose a reformulation of the pricing problem over demands (instead of prices) which is convex. We show that the constrained problem under MNL models can be solved in a polynomial number of Newton iterations. In experiments, our reformulation is solved in seconds rather than days by commercial software. For nested-logit (NL) demand models, we show that the profit is concave in the demands (market shares) when all the price-sensitivity parameters are sufficiently close. The closed-form expressions for the Hessian of the profit that we derive can be used with general-purpose nonlinear solvers. For the special (unconstrained) case already considered in the literature, we devise an algorithm that requires no assumptions on the problem parameters. The class of generalized extreme value (GEV) models includes the NL as well as the cross-nested logit (CNL) model. There is generally no closed form expression for the profit in terms of the demands. We nevertheless how the gradient and Hessian can be computed for use with general-purpose solvers. We show that the objective of a transformed problem is nearly concave when all the price sensitivities are close. For the unconstrained case, we develop a simple and surprisingly efficient first-order method. Our experiments suggest that it always finds a global optimum, for any model parameters. We apply the method to mixed logit (MMNL) models, by showing that they can be approximated with CNL models. With an appropriate sequence of parameter scalings, we conjecture that the solution found is also globally optimal. by Philipp Wilhelm Keller. Ph.D. 2013-12-06T20:51:25Z 2013-12-06T20:51:25Z 2013 2013 Thesis http://hdl.handle.net/1721.1/82871 864008929 eng M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 204 pages application/pdf Massachusetts Institute of Technology |
collection |
NDLTD |
language |
English |
format |
Others
|
sources |
NDLTD |
topic |
Operations Research Center. |
spellingShingle |
Operations Research Center. Keller, Philipp W. (Philipp Wilhelm), 1982- Tractable multi-product pricing under discrete choice models |
description |
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2013. === Cataloged from PDF version of thesis. === Includes bibliographical references (pages 199-204). === We consider a retailer offering an assortment of differentiated substitutable products to price-sensitive customers. Prices are chosen to maximize profit, subject to inventory/ capacity constraints, as well as more general constraints. The profit is not even a quasi-concave function of the prices under the basic multinomial logit (MNL) demand model. Linear constraints can induce a non-convex feasible region. Nevertheless, we show how to efficiently solve the pricing problem under three important, more general families of demand models. Generalized attraction (GA) models broaden the range of nonlinear responses to changes in price. We propose a reformulation of the pricing problem over demands (instead of prices) which is convex. We show that the constrained problem under MNL models can be solved in a polynomial number of Newton iterations. In experiments, our reformulation is solved in seconds rather than days by commercial software. For nested-logit (NL) demand models, we show that the profit is concave in the demands (market shares) when all the price-sensitivity parameters are sufficiently close. The closed-form expressions for the Hessian of the profit that we derive can be used with general-purpose nonlinear solvers. For the special (unconstrained) case already considered in the literature, we devise an algorithm that requires no assumptions on the problem parameters. The class of generalized extreme value (GEV) models includes the NL as well as the cross-nested logit (CNL) model. There is generally no closed form expression for the profit in terms of the demands. We nevertheless how the gradient and Hessian can be computed for use with general-purpose solvers. We show that the objective of a transformed problem is nearly concave when all the price sensitivities are close. For the unconstrained case, we develop a simple and surprisingly efficient first-order method. Our experiments suggest that it always finds a global optimum, for any model parameters. We apply the method to mixed logit (MMNL) models, by showing that they can be approximated with CNL models. With an appropriate sequence of parameter scalings, we conjecture that the solution found is also globally optimal. === by Philipp Wilhelm Keller. === Ph.D. |
author2 |
Retsef Levi and Georgia Perakis. |
author_facet |
Retsef Levi and Georgia Perakis. Keller, Philipp W. (Philipp Wilhelm), 1982- |
author |
Keller, Philipp W. (Philipp Wilhelm), 1982- |
author_sort |
Keller, Philipp W. (Philipp Wilhelm), 1982- |
title |
Tractable multi-product pricing under discrete choice models |
title_short |
Tractable multi-product pricing under discrete choice models |
title_full |
Tractable multi-product pricing under discrete choice models |
title_fullStr |
Tractable multi-product pricing under discrete choice models |
title_full_unstemmed |
Tractable multi-product pricing under discrete choice models |
title_sort |
tractable multi-product pricing under discrete choice models |
publisher |
Massachusetts Institute of Technology |
publishDate |
2013 |
url |
http://hdl.handle.net/1721.1/82871 |
work_keys_str_mv |
AT kellerphilippwphilippwilhelm1982 tractablemultiproductpricingunderdiscretechoicemodels |
_version_ |
1719039081371926528 |