A dual-relax penalty function approach for solving nonlinear bilevel programming with linear lower level problem

DOI10.1016/S0252-9602(11)60265-8zbMath1240.90322OpenAlexW2083698249MaRDI QIDQ655855

Yi-Bing Lü, Guang-Min Wang, Zhong-Ping Wan

Publication date: 27 January 2012

Published in: Acta Mathematica Scientia. Series B. (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0252-9602(11)60265-8

zbMATH Keywords

nonlinear bilevel programmingdual-relax strategypenalty function approach

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Related Items (7)

A trajectory planning of redundant manipulators based on bilevel optimization ⋮ An evolutionary algorithm for solving bilevel programming problems using duality conditions ⋮ An Objective Penalty Function Algorithm for Bilevel Programming Based on Multi-Parameters ⋮ A novel penalty function method for semivectorial bilevel programming problem ⋮ A penalty function method for solving ill-posed bilevel programming problem via weighted summation ⋮ BOLIB: Bilevel Optimization LIBrary of Test Problems ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

This page was built for publication: A dual-relax penalty function approach for solving nonlinear bilevel programming with linear lower level problem