数学物理学报(英文版) ›› 2001, Vol. 21 ›› Issue (1): 69-76.
万仲平, 周树民
MO Zhong-Ping, ZHOU Shu-Min
摘要:
In this paper a new algorithm-approximate penalty function method is de-signed, which can be used to solve a bilevel optimization problem with linear constrained function. In this kind of bilevel optimization problem, the evaluation of the objective function is very difficult, so that only their approximate values can be obtained. This algorithm is obtained by combining penalty function method and approximation in bilevel
programming. The presented algorithm is completely different from existing method. That convergence for this algorithm is proved.
中图分类号: