A duality approach for a class of semivectorial bilevel programming problems

DOI10.1007/s10013-017-0268-5zbMath1405.90137OpenAlexW2776595216MaRDI QIDQ684051

Abdelmalek Aboussoror, Fatima Ezzahra Saissi, Samir Adly

Publication date: 9 February 2018

Published in: Vietnam Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10013-017-0268-5

zbMATH Keywords

stabilitydualityconvex analysisbilevel programmingvectorial programming

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)

Related Items (3)

Optimality conditions for a multiobjective bilevel optimization problem involving set valued constraints ⋮ A new approach to strong duality for composite vector optimization problems ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hierarchical convergence of a double-net algorithm for equilibrium problems and variational inequality problems
• Duality for multiobjective optimization problems with convex objective functions and D.C. constraints
• Theory of multiobjective optimization
• On the relations between different duals assigned to composed optimization problems
• Proper efficiency and the theory of vector maximization
• Optimality Conditions for a Simple Convex Bilevel Programming Problem
• An Extended Fenchel--Lagrange Duality Approach and Optimality Conditions for Strong Bilevel Programming Problems
• Proximal Point Algorithm Controlled by a Slowly Vanishing Term: Applications to Hierarchical Minimization
• Convex Analysis

This page was built for publication: A duality approach for a class of semivectorial bilevel programming problems