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

DOI10.1016/J.AML.2009.09.007zbMATH Open1202.90242OpenAlexW2131140226MaRDI QIDQ710987FDOQ710987

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

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

Cites Work

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

Cited In (2)

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

This page was built for publication: A penalty function method based on bilevel programming for solving inverse optimal value problems

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