Optimality conditions and duality in terms of convexificators for multiobjective bilevel programming problem with equilibrium constraints
type: Item
instance of: scholarly article
title: Optimality conditions and duality in terms of convexificators for multiobjective bilevel programming problem with equilibrium constraints
zbMATH Open document ID: 1476.90304
author: Tran Van Su
author: Dinh Dieu Hang
author: Nguyen Cong Dieu
published in: Computational and Applied Mathematics
publication date: 2021-09-10T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C31
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C46
Mathematics Subject Classification ID: 49J52
zbMATH DE Number: 7394319
zbMATH Keywords: nonsmooth multiobjective bilevel programming problem with equilibrium constraints
zbMATH Keywords: necessary optimality conditions
zbMATH Keywords: convexificators
zbMATH Keywords: \( \partial^*\)-convex functions
zbMATH Keywords: Wolfe-type dual
zbMATH Keywords: Mond-Weir-type dual
MaRDI profile type: Publication
full work available at URL: s40314-021-01431-8
OpenAlex ID: W3128760036
cites work: Necessary optimality conditions for bilevel optimization problems using convexificators
cites work: Computational Difficulties of Bilevel Linear Programming
cites work: Wolfe duality and Mond-Weir duality via perturbations
cites work: Optimization and nonsmooth analysis
cites work: An overview of bilevel optimization
cites work: Optimality conditions for nonsmooth multiobjective bilevel optimization problems
cites work: A necessary and a sufficient optimality condition for bilevel programming problems
cites work: Foundations of bilevel programming
cites work: Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming
cites work: Bilevel road pricing: theoretical analysis and optimality conditions
cites work: New optimality conditions for the semivectorial bilevel optimization problem
cites work: Optimality conditions in terms of convexificators for a bilevel multiobjective optimization problem
cites work: Convexifactors, generalized convexity and vector optimization
cites work: Multiobjective bilevel optimization
cites work: Multicriteria Optimization
cites work: Q4461359
cites work: Nonsmooth calculus, minimality, and monotonicity of convexificators
cites work: Necessary optimality conditions and a new approach to multiobjective bilevel optimization problems
cites work: Scalarization and optimality conditions for vector equilibrium problems
cites work: Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
cites work: Q3141900
cites work: Necessary optimality conditions in terms of convexificators in Lipschitz optimization
cites work: Mathematical Programs with Equilibrium Constraints
cites work: Necessary and sufficient conditions for efficiency via convexificators
cites work: Optimality condition for local efficient solutions of vector equilibrium problems via convexificators and applications
cites work: Optimality and duality in constrained interval-valued optimization
cites work: On Efficiency Conditions for Nonsmooth Vector Equilibrium Problems with Equilibrium Constraints
cites work: Q5589748
cites work: Q3325486
cites work: Necessary and sufficient conditions for nonsmooth mathematical programs with equilibrium constraints
cites work: Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators
cites work: Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators
cites work: Optimality conditions for the efficient solutions of vector equilibrium problems with constraints in terms of directional derivatives and applications
cites work: Duality results for interval-valued pseudoconvex optimization problem with equilibrium constraints with applications
cites work: Studniarski's derivatives and efficiency conditions for constrained vector equilibrium problems with applications
cites work: Second-order efficiency conditions for $C^{1,1}$-vector equilibrium problems in terms of contingent derivatives and applications
cites work: New second-order optimality conditions for vector equilibrium problems with constraints in terms of contingent derivatives
cites work: Optimality and duality results for bilevel programming problem using convexifactors
cites work: Optimality conditions for bilevel programming problems
cites work: Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
cites work: A duality theorem for non-linear programming
DOI: 10.1007/S40314-021-01431-8
description: scientific article; zbMATH DE number 7394319