论文标题
在多属性决策中,分配优先优化可靠的优化
Distributionally Preference Robust Optimization in Multi-Attribute Decision Making
论文作者
论文摘要
最近提出了实用性优先优化(PRO)来处理最佳决策制定问题,而决策者(DM)对收益和损失的偏好是模棱两可的。在本文中,我们进一步研究了DM的偏好不仅模棱两可,而且可能不一致,甚至显示某种随机性。我们提出了一种分布偏好的鲁棒优化(DPRO)方法,其中DM的偏好由随机效用函数表示,歧义是由随机效用的一组概率分布来描述的。新的DPRO模型的一个明显优势是,它不再涉及DM的偏好不一致。在随机效用函数是分段线性结构的情况下,我们提出了两种构建模棱两可的统计方法:椭圆形方法和bootstrap方法从根本上是基于置信区域的置信区域的构思,并通过随机参数的样本平均值进行置信区域,并通过如何通过切割表面algormith和siscocp soccp solved来解决。我们还展示了具有一般随机效用函数的DPRO模型如何由具有分段线性随机效用函数的模型近似。最后,我们将提出的DPRO模型应用于汽车制造和设施的位置计划,并展示如何通过多项式Logit方法和联合分析/机器学习提取随机样品。该论文是首次尝试使用分布强大的优化方法作为Pro。
Utility preference robust optimization (PRO) has recently been proposed to deal with optimal decision making problems where the decision maker's (DM) preference over gains and losses is ambiguous. In this paper, we take a step further to investigate the case that the DM's preference is not only ambiguous but also potentially inconsistent or even displaying some kind of randomness. We propose a distributionally preference robust optimization (DPRO) approach where the DM's preference is represented by a random utility function and the ambiguity is described by a set of probability distributions of the random utility. An obvious advantage of the new DPRO model is that it no longer concerns the DM's preference inconsistency. In the case when the random utility functions are of piecewise linear structure, we propose two statistical methods for constructing the ambiguity set: an ellipsoidal method and a bootstrap method both of which are fundamentally based on the idea of confidence region with the sample mean of the random parameters, and demonstrate how the resulting DPRO can be solved by a cutting surface algorithm and an MISOCP respectively. We also show how the DPRO models with general random utility functions may be approximated by those with piecewise linear random utility functions. Finally, we apply the proposed DPRO model in car manufacturing and facility location planning and show how the random samples may be extracted by multinomial logit method and conjoint analysis/machine learning. The paper is the first attempt to use distributionally robust optimization methods for PRO.