Optimality conditions and duality in terms of convexificators for multiobjective bilevel programming problem with equilibrium constraints
DOI10.1007/s40314-021-01431-8zbMath1476.90304OpenAlexW3128760036MaRDI QIDQ1983853
Nguyen Cong Dieu, Tran Van Su, Dinh Dieu Hang
Publication date: 10 September 2021
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-021-01431-8
necessary optimality conditionsWolfe-type dualconvexificators\( \partial^*\)-convex functionsMond-Weir-type dualnonsmooth multiobjective bilevel programming problem with equilibrium constraints
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31) Nonsmooth analysis (49J52) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality condition for local efficient solutions of vector equilibrium problems via convexificators and applications
- Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- Optimality and duality results for bilevel programming problem using convexifactors
- Scalarization and optimality conditions for vector equilibrium problems
- Necessary and sufficient conditions for nonsmooth mathematical programs with equilibrium constraints
- Multiobjective bilevel optimization
- Wolfe duality and Mond-Weir duality via perturbations
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Foundations of bilevel programming
- Optimality and duality in constrained interval-valued optimization
- Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators
- Bilevel road pricing: theoretical analysis and optimality conditions
- Necessary optimality conditions and a new approach to multiobjective bilevel optimization problems
- New optimality conditions for the semivectorial bilevel optimization problem
- Optimality conditions for nonsmooth multiobjective bilevel optimization problems
- New second-order optimality conditions for vector equilibrium problems with constraints in terms of contingent derivatives
- Duality results for interval-valued pseudoconvex optimization problem with equilibrium constraints with applications
- Necessary and sufficient conditions for efficiency via convexificators
- Optimality conditions for the efficient solutions of vector equilibrium problems with constraints in terms of directional derivatives and applications
- Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming
- Necessary optimality conditions in terms of convexificators in Lipschitz optimization
- An overview of bilevel optimization
- Necessary optimality conditions for bilevel optimization problems using convexificators
- On Efficiency Conditions for Nonsmooth Vector Equilibrium Problems with Equilibrium Constraints
- Computational Difficulties of Bilevel Linear Programming
- Optimization and nonsmooth analysis
- A duality theorem for non-linear programming
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- A necessary and a sufficient optimality condition for bilevel programming problems
- Convexifactors, generalized convexity and vector optimization
- Optimality conditions for bilevel programming problems
- Optimality conditions in terms of convexificators for a bilevel multiobjective optimization problem
- Studniarski's derivatives and efficiency conditions for constrained vector equilibrium problems with applications
- Second-order efficiency conditions for $C^{1,1}$-vector equilibrium problems in terms of contingent derivatives and applications
- Multicriteria Optimization
- Mathematical Programs with Equilibrium Constraints
This page was built for publication: Optimality conditions and duality in terms of convexificators for multiobjective bilevel programming problem with equilibrium constraints
