返回
A two-level vertex-searching global algorithm framework for bilevel linear fractional programming problems
DOI:10.1080/21642583.2020.1805815.png)
摘要
En 中文
We propose a new two-level vertex-searching algorithm framework that finds a global optimal solution to the continuous bilevel linear fractional programming problem over a compact polyhedron, in which both the upper and the lower objectives are linear fractional. Our solution method adopts the vertex-searching approach on the polyhedron, and the search space is determined by the set of candidates of optimal base to the lower level problem. In order to search base, a modified enumerative scheme, that is a new upper bound filter scheme inserted into the classical enumerative scheme, is proposed. The main solution procedure is designed on solving a sequence of upper and lower level mathematical programs; instead of a single-level problem reformulation approach, which is popularly and widely used in literature. An extension on general upper level objective functions such as quasiconvex/quasiconcave for the proposed vertex-searching approach is discussed. Numerical experiments show that our algorithm leads us to a global optimum. We conclude that our proposed algorithm framework has the simplest solution procedure and has potential efficiency advantages, which may reduce the complexity of enumerative schemes for medium or large-scale problems, while comparing with existing global algorithms such as theKth-best algorithm (a two-level vertex-searching algorithm) and the single-level duality-based reformulation algorithm (a single-level vertex-searching algorithm).
Keyword:
Bilevel programming
extreme point approach
linear fractional programming
quasiconvexity
nonconvex programming
global optimization
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.4
论文数:
486
被引数:
2.1K
机构
引用论文
Inward electromagnetic wave coupling in hybrid subwavelength structures illuminated with secondary imaging次级成像照射下混合亚波长结构中的内向电磁波耦合

