A Branch and Bound-Based Algorithm for the Weak Linear Bilevel Programming Problems |
| |
Authors: | June Liu Yunfei Hong Yue Zheng |
| |
Institution: | 1.School of Management,Huaibei Normal University,Huaibei, Anhui,China;2.School of Information and Mathematics,Yangtze University,Jingzhou, Hubei,China |
| |
Abstract: | Most real-world optimization problems are hierarchical involving non-cooperative objectives. Many of these problems can be formulated in terms of the first (upper level) objective function being minimized over the solution set mapping of the second (lower level) optimization problem. Often the upper level decision maker is risk-averse. The resulting class of problem is named weak bilevel programming problem. This paper presents a new algorithm which embeds a penalty function method into a branch and bound algorithm to deal with a weak linear bilevel programming problem. An example illustrates the feasibility of the proposed algorithm. |
| |
Keywords: | |
本文献已被 CNKI SpringerLink 等数据库收录! |
|