The convergence of approach penalty function method for approximate bilevel programming problem

DOI10.1016/S0252-9602(17)30578-7MaRDI QIDQ5946693zbMATH OpenOpenAlexFDO

Authors Zhongping Wan, Shumin Zhou

Publication date 12 March 2002

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(17)30578-7

zbMATH Keywords

approximation methodbilevel programmingconvergencepenalty function method

Mathematics Subject Classification ID

Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Double penalty method for bilevel optimization problems
• An objective penalty function of bilevel programming
• A dual-relax penalty function approach for solving nonlinear bilevel programming with linear lower level problem
• An approximate programming method based on the simplex method for bilevel programming problem
• scientific article; zbMATH DE number 1559437

Cited in

(5)

• Double penalty method for bilevel optimization problems
• scientific article; zbMATH DE number 1131734 (Why is no real title available?)
• Bilevel optimization: theory, algorithms, applications and a bibliography
• Combining approximation and exact penalty in hierarchical programming
• An approximate programming method based on the simplex method for bilevel programming problem

This page was built for publication: The convergence of approach penalty function method for approximate bilevel programming problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5946693)