Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators
From MaRDI portal
Publication:1730476
DOI10.1007/s10479-017-2422-6zbMath1434.90207OpenAlexW2587583146MaRDI QIDQ1730476
Yogendra Pandey, Shashi Kant Mishra
Publication date: 6 March 2019
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-017-2422-6
optimality conditionssemi-infinite programmingmathematical programming problems with equilibrium constraintsconvexificatorsWolfe type dualMond-Weir type dual
Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Semi-infinite programming (90C34)
Related Items
On variational inequalities using directional convexificators, Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints, New dualities for mathematical programs with vanishing constraints, Duality results for interval-valued pseudoconvex optimization problem with equilibrium constraints with applications, Duality results for interval-valued semiinfinite optimization problems with equilibrium constraints using convexificators, Optimality conditions for mathematical programs with equilibrium constraints using directional convexificators, Optimality and duality for nonsmooth mathematical programming problems with equilibrium constraints, ϵ-Efficient solutions in semi-infinite multiobjective optimization, Karush-Kuhn-Tucker optimality conditions and duality for semi-infinite programming problems with vanishing constraints, Optimality conditions and duality in terms of convexificators for multiobjective bilevel programming problem with equilibrium constraints, Optimality conditions of a set valued optimization problem with the help of directional convexificators, On sufficiency and duality theorems for nonsmooth semi-infinite mathematical programming problem with equilibrium constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On duality for mathematical programs with vanishing constraints
- Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators
- Second-order optimality conditions for mathematical programs with equilibrium constraints
- A relaxed constant positive linear dependence constraint qualification for mathematical programs with equilibrium constraints
- Constraint qualifications for mathematical programs with equilibrium constraints and their local preservation property
- Enhanced Karush-Kuhn-Tucker conditions for mathematical programs with equilibrium constraints
- Solving mathematical programs with equilibrium constraints
- Optimality and duality results for bilevel programming problem using convexifactors
- Duality for nonsmooth semi-infinite programming problems
- Convexificators and strong Kuhn-Tucker conditions
- Necessary and sufficient conditions for nonsmooth mathematical programs with equilibrium constraints
- Semi-infinite programming
- Solving nonlinear bilevel programming models of the equilibrium network design problem: A comparative review
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Hunting for a smaller convex subdifferential
- Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
- Bilevel road pricing: theoretical analysis and optimality conditions
- A modified relaxation scheme for mathematical programs with complementarity constraints
- On strong KKT type sufficient optimality conditions for nonsmooth multiobjective semi-infinite mathematical programming problems with equilibrium constraints
- Notes on some constraint qualifications for mathematical programs with equilibrium constraints
- Necessary optimality conditions in terms of convexificators in Lipschitz optimization
- A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints
- An overview of bilevel optimization
- Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators
- Introduction to Nonsmooth Optimization
- Semi-Infinite Programming: Theory, Methods, and Applications
- A duality theorem for non-linear programming
- Convexifactors, generalized convexity and vector optimization
- Optimality Conditions and Duality for Semi-Infinite Mathematical Programming Problem with Equilibrium Constraints
- Mathematical Programs with Equilibrium Constraints
- Semi-infinite programming. Recent advances
