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

基于无参数析取分解求解线性双层规划的新型计算方法

A New Computational Approach for Solving Linear Bilevel Programs Based on Parameter-Free Disjunctive Decomposition

Saeed Mohammadi, Mohammad Reza Hesamzadeh, Steven A. Gabriel, Dina Khastieva

AI总结:

针对线性双层规划单层重构中big-M计算NP难的问题,提出一种无参数的基于析取的分解算法,可保证最优解并展现良好性能。

摘要:

线性双层规划(linear BLPs)已广泛应用于计算数学和优化中的多个场景。线性BLP的单层重构用其Karush-Kuhn-Tucker最优性条件替代下层线性规划,并使用big-M技术线性化互补松弛条件。尽管该方法直接明了,但它需要寻找big-M,而近期研究表明计算big-M是NP难的。本文提出一种基于析取的分解算法,无需寻找big-M,同时保证所得解为最优。我们的经验表明,该算法具有良好的性能。

英文摘要:

Linear bilevel programs (linear BLPs) have been widely used in computational mathematics and optimization in several applications. Single-level reformulation for linear BLPs replaces the lower-level linear program with its Karush-Kuhn-Tucker optimality conditions and linearizes the complementary slackness conditions using the big-M technique. Although the approach is straightforward, it requires finding the big-M whose computation is recently shown to be NP-hard. This paper presents a disjunctive-based decomposition algorithm which does not need finding the big-Ms whereas guaranteeing that obtained solution is optimal. Our experience shows promising performance of our algorithm.

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

↑