首页 | 本学科首页   官方微博 | 高级检索  
     


An approximate programming method based on the simplex method for bilevel programming problem
Authors:Guangmin Wang  Kejun Zhu  Zhongping Wan
Affiliation:1. School of Economics and Management, China University of Geosciences, Wuhan 430074, PR China;2. School of Mathematics and Statistics, Wuhan University, Wuhan 430072, PR China
Abstract:Many real problems can be modeled to the problems with a hierarchical structure, and bilevel programming is a useful tool to solve the hierarchical optimization problems. So the bilevel programming is widely applied, and numerous methods have been proposed to solve this programming. In this paper, we propose an approximate programming algorithm to solve bilevel nonlinear programming problem. Finally, the example illustrates the feasibility of the proposed algorithm.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号