首页> 外文期刊>Computers & operations research >Optimal pricing to minimize maximum regret with limited demand information
【24h】

Optimal pricing to minimize maximum regret with limited demand information

机译:最佳定价,以最大限度地减少有限需求信息的最大遗憾

获取原文
获取原文并翻译 | 示例
           

摘要

In this paper, we consider a pricing problem faced by a seller that sells a given inventory of some product over a short selling horizon with limited demand information. The seller knows only that the demand is a linear function of the price, but does not know the parameters involved in the demand function. However, the seller knows that each parameter involved in the demand function belongs to a known interval. The seller's objective is to determine the optimal price for the entire selling season to minimize the maximum regret, where the maximum regret is defined as the maximum possible loss of revenue due to not knowing the precise values of the parameters. We derive closed-form optimal solutions for the problem under all possible cases of input parameters and identify some structural properties of the solution. We conduct computational tests to compare our modeling approach with several benchmark approaches and report related insights. (c) 2020 Elsevier Ltd. All rights reserved.
机译:在本文中,我们考虑卖方面临的定价问题,这些问题在短的卖出地平线上销售了一些产品的给定库存,需求有限。卖方只知道需求是价格的线性函数,但不知道需求函数中涉及的参数。但是,卖方知道需求函数中涉及的每个参数属于已知的间隔。卖方的目标是确定整个销售季节的最佳价格,以最大限度地减少最大遗憾,其中最大遗憾被定义为由于不知道参数的精确值而被定义为收入的最大可能损失。我们在所有可能的输入参数的情况下派生封闭式最佳解决方案,并确定解决方案的一些结构性。我们进行计算测试,以比较我们的建模方法,并以几个基准方法和报告相关见解。 (c)2020 elestvier有限公司保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号