arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2005.07482math.OC

离散混合Logit需求下静态定价问题的精确算法

An exact algorithm for the static pricing problem under discrete mixed logit demand

Ahmadreza Marandi, Virginie Lurkin

AI总结:

针对离散混合多项Logit需求下的静态多产品定价问题,提出基于信赖域和分段线性松弛的迭代优化算法及新分支方法,渐近收敛至最优解并在停车服务案例中验证有效性。

摘要:

价格差异化是许多市场中常见的策略。本文研究一个静态多产品价格优化问题,其需求由离散混合多项Logit模型给出。通过考虑在效用设定中包含个体特定变量的混合Logit模型,我们的定价问题很好地反映了实践中使用的离散选择模型。为求解该定价问题,我们设计了一种高效的迭代优化算法,该算法渐近收敛至最优解。为此,基于信赖域方法构建了一个线性优化(LO)问题,以寻找一个“良好”的可行解并从下方逼近该问题。同时,利用分段线性松弛设计了另一个LO问题,从上方逼近该优化问题。随后,我们开发了一种新的分支方法以收紧最优性间隙。该算法的有效性在停车服务定价案例中得到了验证,并与求解器及现有文献贡献进行了基准对比。

英文摘要:

Price differentiation is a common strategy in many markets. In this paper, we study a static multiproduct price optimization problem with demand given by a discrete mixed multinomial logit model. By considering a mixed logit model that includes individual-specific variables in the utility specification, our pricing problem reflects well the discrete choice models used in practice. To solve this pricing problem, we design an efficient iterative optimization algorithm that asymptotically converges to the optimal solution. To this end, a linear optimization (LO) problem is formulated, based on the trust-region approach, to find a "good" feasible solution and approximate the problem from below. Another LO problem is designed using piecewise linear relaxations to approximate the optimization problem from above. Then, we develop a new branching method to tighten the optimality gap. The effectiveness of our algorithm is demonstrated on a parking services pricing case, and a benchmark against solvers and existing contributions in the literature are performed.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑