A solution method for the optimistic linear semivectorial bilevel optimization problem
From MaRDI portal
Publication:2405617
DOI10.1186/1029-242X-2014-164zbMath1380.90245OpenAlexW2111999692WikidataQ59323721 ScholiaQ59323721MaRDI QIDQ2405617
Publication date: 26 September 2017
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/1029-242x-2014-164
Related Items
A semivectorial bilevel programming approach to optimize electricity dynamic time-of-use retail pricing ⋮ A new exact method for linear bilevel problems with multiple objective functions at the lower level ⋮ Methods for Multiobjective Bilevel Optimization ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ A smoothing approach for solving transportation problem with road toll pricing and capacity expansions
Cites Work
- Unnamed Item
- Solution algorithm for an optimistic linear Stackelberg problem
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- Multiobjective bilevel optimization
- An exact penalty on bilevel programs with linear vector optimization lower level
- Practical bilevel optimization. Algorithms and applications
- Bilevel and multilevel programming: A bibliography review
- Foundations of bilevel programming
- New optimality conditions for the semivectorial bilevel optimization problem
- A solution method for semivectorial bilevel programming problem via penalty method
- Semivectorial bilevel optimization problem: penalty approach
- A penalty function method based on Kuhn-Tucker condition for solving linear bilevel programming
- Optimality conditions for bilevel programming problems
- Convex Analysis
- A quadratically-convergent algorithm for general nonlinear programming problems
