A penalty function method based on bilevel programming for solving inverse optimal value problems

DOI10.1016/j.aml.2009.09.007zbMath1202.90242OpenAlexW2131140226MaRDI QIDQ710987

D. Kharzeev

Publication date: 25 October 2010

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2009.09.007

zbMATH Keywords

partial calmness

Mathematics Subject Classification ID

Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Related Items

Inequalities for the medians and vertex distances of two n-simplices with applications ⋮ A Cutting Plane Approach for Solving Linear Bilevel Programming Problems

Cites Work

• Unnamed Item
• A penalty function method for solving inverse optimal value problem
• Practical bilevel optimization. Algorithms and applications
• On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
• Descent approaches for quadratic bilevel programming
• The inverse optimal value problem
• Calculating some inverse linear programming problems
• A penalty function method based on Kuhn-Tucker condition for solving linear bilevel programming
• Inverse Optimization
• Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems