利用逆Optimization推导线性可行域
Inferring Linear Feasible Regions using Inverse Optimization
摘要:
考虑一个问题,其中专家提供了一组可行的观测,并定义了一个成本函数,该函数表征了哪些观测占主导地位,因此是首选的。我们的目标是找到一组线性约束,使所有给定的观测可行,同时使首选的成本(目标)函数的最佳。通过这样做,我们推断出线性规划问题的隐可行域。提供这样的可行域(i)建立用于将未来观测分类为可行或不可行的基线,以及(ii)允许使用灵敏度分析来辨别最优解的变化,如果目标函数在未来改变的话。在本文中,我们提出了一个逆优化框架,以恢复使用多个过去的观察作为输入的前向最优化问题的约束。我们专注于线性模型中的目标函数是已知的,但约束矩阵是部分或全部未知。我们提出了一个通用的逆优化方法,恢复完整的约束矩阵,然后引入一个易于处理的等价的重新制定。此外,我们提供并讨论了几个广义损失函数,告知用户偏好和历史数据的基础上的可行域的理想属性。我们的数值例子验证了我们的方法的有效性,强调所提出的措施之间的差异,并提供大规模实施的直觉。我们进一步展示了我们的方法,使用饮食推荐问题,以显示所提出的模型可以帮助每个节食者的个性化约束。
英文摘要:
Consider a problem where a set of feasible observations are provided by an expert and a cost function is defined that characterizes which of the observations dominate the others and are hence, preferred. Our goal is to find a set of linear constraints that would render all the given observations feasible while making the preferred ones optimal for the cost (objective) function. By doing so, we infer the implicit feasible region of the linear programming problem. Providing such feasible regions (i) builds a baseline for categorizing future observations as feasible or infeasible, and (ii) allows for using sensitivity analysis to discern changes in optimal solutions if the objective function changes in the future. In this paper, we propose an inverse optimization framework to recover the constraints of a forward optimization problem using multiple past observations as input. We focus on linear models in which the objective function is known but the constraint matrix is partially or fully unknown. We propose a general inverse optimization methodology that recovers the complete constraint matrix and then introduce a tractable equivalent reformulation. Furthermore, we provide and discuss several generalized loss functions to inform the desirable properties of the feasible region based on user preference and historical data. Our numerical examples verify the validity of our approach, emphasize the differences among the proposed measures, and provide intuition for large-scale implementations. We further demonstrate our approach using a diet recommendation problem to show how the proposed models can help impute personalized constraints for each dieter.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。