Optimality and duality for nonsmooth mathematical programming problems with equilibrium constraints
From MaRDI portal
Publication:2689861
DOI10.1007/s10898-022-01231-2OpenAlexW4294147242MaRDI QIDQ2689861
Publication date: 14 March 2023
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-022-01231-2
sufficient optimality conditionscontingent epiderivativesWolfe and Mond-Weir types dual modelGA-stationary vectornonsmooth mathematical programming problem with equilibrium constraints
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Optimality conditions and duality for interval-valued optimization problems using convexifactors
- Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators
- On sufficiency and duality for a class of interval-valued programming problems
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- Optimality and duality results for bilevel programming problem using convexifactors
- Duality for nonsmooth semi-infinite programming problems
- Necessary and sufficient conditions for nonsmooth mathematical programs with equilibrium constraints
- About contingent epiderivatives
- Semi-infinite programming
- Wolfe duality and Mond-Weir duality via perturbations
- Scalarization and optimality conditions for strict minimizers in multiobjective optimization via contingent epiderivatives
- Contingent epiderivatives and set-valued optimization
- The existence of contingent epiderivatives for set-valued maps
- New optimality conditions for unconstrained vector equilibrium problem in terms of contingent derivatives in Banach spaces
- 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
- Optimality conditions and duality in terms of convexificators for multiobjective bilevel programming problem with equilibrium constraints
- Optimality conditions for nonsmooth multiobjective bilevel optimization problems
- Duality results for interval-valued pseudoconvex optimization problem with equilibrium constraints with applications
- On interval-valued nonlinear programming problems
- Contingent derivatives of set-valued maps and applications to vector optimization
- Variational characterization of the contingent epiderivative
- On Efficiency Conditions for Nonsmooth Vector Equilibrium Problems with Equilibrium Constraints
- Optimality Conditions for Vector Equilibrium Problems in Terms of Contingent Epiderivatives
- First order optimality conditions in vector optimization involving stable functions
- A duality theorem for non-linear programming
- Some Calculus Rules for Contingent Epiderivatives
- Contingent derivatives and necessary efficiency conditions for vector equilibrium problems with constraints
- Convex Analysis
- Set-valued analysis
- Duality for nonsmooth mathematical programming problems with equilibrium constraints
This page was built for publication: Optimality and duality for nonsmooth mathematical programming problems with equilibrium constraints
