On sufficiency and duality theorems for nonsmooth semi-infinite mathematical programming problem with equilibrium constraints
From MaRDI portal
Publication:2089243
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
Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Convexity of real functions of several variables, generalizations (26B25) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Semi-infinite programming (90C34) Duality theory (optimization) (49N15)
Recommendations
- Optimality Conditions and Duality for Semi-Infinite Mathematical Programming Problem with Equilibrium Constraints
- Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators
- Optimality and duality for nonsmooth mathematical programming problems with equilibrium constraints
- Duality for nonsmooth mathematical programming problems with equilibrium constraints
- Optimality and duality for nonsmooth semi-infinite mathematical program with equilibrium constraints involving generalized invexity of order σ > 0
- Lagrange duality and saddle point optimality conditions for semi-infinite mathematical programming problems with equilibrium constraints
- On the sufficiency and the duality of solutions for nonsmooth \((h,\varphi)\)-semi-infinite programming
- scientific article; zbMATH DE number 2187905
- On semi-infinite mathematical programming problems with equilibrium constraints using generalized convexity
- Duality for nonsmooth semi-infinite programming problems
Cites work
- scientific article; zbMATH DE number 3856842 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- A duality theorem for non-linear programming
- About contingent epiderivatives
- An overview of bilevel optimization
- Bilevel road pricing: theoretical analysis and optimality conditions
- Contingent derivatives and necessary efficiency conditions for vector equilibrium problems with constraints
- Contingent derivatives of set-valued maps and applications to vector optimization
- Contingent epiderivatives and set-valued optimization
- Convex Analysis
- Duality for nonsmooth mathematical programming problems with equilibrium constraints
- Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators
- Duality for nonsmooth semi-infinite programming problems
- Duality results for interval-valued pseudoconvex optimization problem with equilibrium constraints with applications
- First order optimality conditions in vector optimization involving stable functions
- Introduction to nonsmooth optimization. Theory, practice and software
- Necessary and sufficient conditions for nonsmooth mathematical programs with equilibrium constraints
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- New optimality conditions for unconstrained vector equilibrium problem in terms of contingent derivatives in Banach spaces
- On efficiency conditions for nonsmooth vector equilibrium problems with equilibrium constraints
- On interval-valued nonlinear programming problems
- On nonsmooth V-invexity and vector variational-like inequalities in terms of the Michel-Penot subdifferentials
- On strong KKT type sufficient optimality conditions for multiobjective semi-infinite programming problems with vanishing constraints
- On sufficiency and duality for a class of interval-valued programming problems
- Optimality Conditions and Duality for Semi-Infinite Mathematical Programming Problem with Equilibrium Constraints
- Optimality Conditions for Vector Equilibrium Problems in Terms of Contingent Epiderivatives
- Optimality and duality in constrained interval-valued optimization
- Optimality and duality results for bilevel programming problem using convexifactors
- Optimality conditions and Mond-Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints
- Optimality conditions and duality for interval-valued optimization problems using convexifactors
- Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators
- Optimality conditions and duality in terms of convexificators for multiobjective bilevel programming problem with equilibrium constraints
- Optimality conditions for nonsmooth multiobjective bilevel optimization problems
- Optimality conditions in terms of contingent epiderivatives for strict local Pareto minima in vector optimization problems with constraints
- Scalarization and optimality conditions for strict minimizers in multiobjective optimization via contingent epiderivatives
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semi-infinite programming
- Semi-infinite programming. Recent advances
- Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
- Set-valued analysis
- Some Calculus Rules for Contingent Epiderivatives
- The existence of contingent epiderivatives for set-valued maps
- Variational characterization of the contingent epiderivative
- Wolfe duality and Mond-Weir duality via perturbations
Cited in
(3)- Optimality conditions and duality theorems for nonsmooth semi-infinite interval-valued mathematical programs with vanishing constraints
- Optimality analysis and duality conditions for a class of conic semi-infinite program having vanishing constraints
- Optimality and duality for nonsmooth semi-infinite mathematical program with equilibrium constraints involving generalized invexity of order σ > 0
This page was built for publication: On sufficiency and duality theorems for nonsmooth semi-infinite mathematical programming problem with equilibrium constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2089243)
