arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2604.11533math.OC
收藏

面向线性规划右边参数的决策感知预测

Decision-Aware Predictions for Right-Hand Side Parameters in Linear Programs

Southern Methodist University(南方卫理公会大学)

Jackson Forner, Miju Ahn, Harsha Gangammanavar

AI总结:

本文研究了一种集成学习与优化问题,通过上下文向量预测线性规划的右边参数,并通过历史可行解保证预测区域包含真实解。

摘要:

本文研究了一个集成学习和优化问题,其中预测模型利用上下文向量估计线性规划(LP)的右边参数。考虑到此类预测会改变LP的可行区域,我们旨在估计一个包含底层LP真实右边参数最优解的约束集。我们提出了通过最小化决策误差并考虑可行性(通过历史的原始和对偶解集合)来训练预测模型的公式。我们的分析确定了在何种条件下预测的可行区域包含真实解,以及后者是否在预测问题中达到最优。为了解决替代训练问题,我们采用了现有的LP和非凸规划求解方法。我们在合成LP和网络优化问题上进行了数值实验。我们的结果表明,所提出的方法在实现所需可行性方面优于标准回归模型。

英文摘要:

This paper studies an integrated learning and optimization problem in which a prediction model estimates the right-hand-side parameters of a linear program (LP) using a contextual vector. Considering that such a prediction alters the feasible region of the LP, we aim to estimate the constraint set to contain the optimal solution of the underlying LP, given by the true right-hand side parameters. We propose formulations for training a prediction model by minimizing the decision error while accounting for feasibility, measured by a collection of historical primal and dual solutions. Our analysis identifies conditions under which a resulting predicted feasible region contains the true solution, and whether the latter solution achieves optimality for the predicted problem. To solve the alternative training problems, we employ existing LP and nonconvex programming solution methods. We conduct numerical experiments on a synthetic LP and a network optimization problem. Our results indicate that the proposed methods effectively implement the desired feasibility, compared to standard regression models.

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

↑