Paper Info
Title
An approximate programming method based on the simplex method for bilevel programming problem
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.
Year
DOI
Venue
2010
10.1016/j.camwa.2010.03.027
Computers & Mathematics with Applications
Keywords
Field
DocType
bilevel programming,bilevel nonlinear programming problem,useful tool,simplex method,approximate programming algorithm,proposed algorithm,numerous method,bilevel programming problem,bilevel nonlinear programming,hierarchical optimization problem,approximate programming method,hierarchical structure,smooth function,real problem,optimization problem,function approximation,nonlinear programming,numerical method
Linear-fractional programming,Mathematical optimization,Simplex algorithm,Bilevel optimization,Nonlinear programming,Algorithm,Smoothness,Criss-cross algorithm,Optimization problem,Fractional programming,Mathematics
Journal
Volume
Issue
ISSN
59
10
Computers and Mathematics with Applications
Citations 
PageRank 
References 
3
0.39
6
Authors
3
Name
Order
Citations
PageRank
Guangmin Wang118014.73
Kejun Zhu217722.96
Zhongping Wan320819.04