On sufficiency and duality theorems for nonsmooth semi-infinite mathematical programming problem with equilibrium constraints
DOI10.1007/s12190-021-01655-1zbMath1505.90132OpenAlexW3207991523WikidataQ113899618 ScholiaQ113899618MaRDI QIDQ2089243
Publication date: 6 October 2022
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-021-01655-1
contingent epiderivative\(\Psi\)-invex set\(\Psi\)-preinvex function\(\Psi\)-quasi-convex functionGA-stationary vectorsgeneralized Slater constraint qualificationsMond-Weir and Wolfe types dual modelnonsmooth semi-infinite mathematical programming problem with equilibrium constraintssufficiency and duality theorems
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Semi-infinite programming (90C34) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Duality theory (optimization) (49N15) Convexity of real functions of several variables, generalizations (26B25)
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
- On nonsmooth V-invexity and vector variational-like inequalities in terms of the Michel-Penot subdifferentials
- 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
- Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
- 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
- On strong KKT type sufficient optimality conditions for multiobjective semi-infinite programming problems with vanishing constraints
- 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 in terms of contingent epiderivatives for strict local Pareto minima in vector optimization problems with constraints
- Optimality conditions and Mond-Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing 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
- An overview of bilevel optimization
- 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
- Introduction to Nonsmooth Optimization
- Semi-Infinite Programming: Theory, Methods, and Applications
- 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
- Optimality Conditions and Duality for Semi-Infinite Mathematical Programming Problem with Equilibrium Constraints
- Convex Analysis
- Set-valued analysis
- Semi-infinite programming. Recent advances
- Duality for nonsmooth mathematical programming problems with equilibrium constraints
This page was built for publication: On sufficiency and duality theorems for nonsmooth semi-infinite mathematical programming problem with equilibrium constraints
