A penalty function method for solving inverse optimal value problem
From MaRDI portal
Publication:939520
DOI10.1016/j.cam.2007.08.005zbMath1211.90122OpenAlexW2170756749MaRDI QIDQ939520
Tiesong Hu, Yibing Lv, Zhong-Ping Wan
Publication date: 22 August 2008
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2007.08.005
Related Items (8)
The restricted inverse optimal value problem on shortest path under \(l_1\) norm on trees ⋮ Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm ⋮ Exact penalty method for the nonlinear bilevel programming problem ⋮ A penalty function method based on bilevel programming for solving inverse optimal value problems ⋮ The lower bounded inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm ⋮ A Cutting Plane Approach for Solving Linear Bilevel Programming Problems ⋮ Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance ⋮ Combinatorial algorithms for solving the restricted bounded inverse optimal value problem on minimum spanning tree under weighted \(l_\infty\) norm
Cites Work
- Unnamed Item
- On an instance of the inverse shortest paths problem
- Double penalty method for bilevel optimization problems
- 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 steepest descent direction for the nonlinear bilevel programming problem
- 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
- Computational Difficulties of Bilevel Linear Programming
- Inverse Optimization
This page was built for publication: A penalty function method for solving inverse optimal value problem
