Optimality conditions for a class of properly efficient solutions of strong multiobjective bilevel optimization problems
Abstract
In this paper, we are concerned with a strong vectorial nonlinear bilevel programming problem whose upper and lower levels are vectorial.For such a problem, we give a conjugate duality approach based on Scalarization, regularization, and conjugate duality.We show that any accumulation point of the sequence of scalarized-regularized solutions solves the bilevel programming problem.Via this duality approach, we establish necessary optimality conditions for the scalarized-regularized problem.We also provide necessary and sufficient optimality conditions for a class of properly efficient solutions of the bilevel programming problem.
Fields of Study & Subjects
Optimization and Variational Analysis
Advanced Multi-Objective Optimization Algorithms
Advanced Optimization Algorithms Research
Publication details
- Journal / source
- Applied Set-Valued Analysis and Optimization
- Volume
- 8
- Issue
- 2
- Pages
- 179–203
- Publication date
- 17 January 2026