A solution method for semivectorial bilevel programming problem via penalty method
From MaRDI portal
Publication:2251733
DOI10.1007/s12190-010-0430-7zbMath1297.90131OpenAlexW2108630901MaRDI QIDQ2251733
Publication date: 15 July 2014
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-010-0430-7
Nonconvex programming, global optimization (90C26) Sensitivity, stability, parametric optimization (90C31)
Related Items
Solving linear bilevel multiobjective programming problem via exact penalty function approach ⋮ Optimizing over the properly efficient set of convex multi-objective optimization problems ⋮ Optimization of facility location and size problem based on bi-level multi-objective programming ⋮ A semivectorial bilevel programming approach to optimize electricity dynamic time-of-use retail pricing ⋮ A new method for solving multiobjective bilevel programs ⋮ A solution method for the optimistic linear semivectorial bilevel optimization problem ⋮ New optimality conditions and a scalarization approach for a nonconvex semi-vectorial bilevel optimization problem ⋮ A new exact method for linear bilevel problems with multiple objective functions at the lower level ⋮ Semivectorial bilevel optimization on Riemannian manifolds ⋮ Solving discrete linear fractional bilevel programs with multiple objectives at the upper level ⋮ New optimality conditions for the semivectorial bilevel optimization problem ⋮ Stochastic optimization over a Pareto set associated with a stochastic multi-objective optimization problem ⋮ A smoothing method for solving bilevel multiobjective programming problems ⋮ Optimality Conditions for Semivectorial Bilevel Convex Optimal Control Problems ⋮ Post-Pareto analysis and a new algorithm for the optimal parameter tuning of the elastic net ⋮ A novel penalty function method for semivectorial bilevel programming problem ⋮ A penalty function method for solving ill-posed bilevel programming problem via weighted summation ⋮ Semivectorial bilevel programming versus scalar bilevel programming ⋮ Necessary optimality conditions for semi-vectorial bi-level optimization with convex lower level: theoretical results and applications to the quadratic case ⋮ Stability for semivectorial bilevel programs ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ Optimality conditions for pessimistic semivectorial bilevel programming problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bilevel programming: a survey
- Optimality and duality in nondifferentiable multiobjective mathematical programming involving higher order \((F,\alpha,\rho,d)\)-type I functions
- An exact penalty on bilevel programs with linear vector optimization lower level
- Practical bilevel optimization. Algorithms and applications
- Nonlinear multiobjective optimization
- Bilevel and multilevel programming: A bibliography review
- Foundations of bilevel programming
- An objective penalty function method for nonlinear programming.
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
- Semivectorial bilevel optimization problem: penalty approach
- An overview of bilevel optimization
- Computational Difficulties of Bilevel Linear Programming
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Optimization over the efficient set
- Optimization over the efficient set
This page was built for publication: A solution method for semivectorial bilevel programming problem via penalty method