On semi-infinite mathematical programming problems with equilibrium constraints using generalized convexity
From MaRDI portal
Publication:2656887
DOI10.1007/s40305-019-00263-yzbMath1474.90490OpenAlexW2971758562MaRDI QIDQ2656887
Pankaj Kumar, Bhuwan Chandra Joshi, Shashi Kant Mishra
Publication date: 17 March 2021
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-019-00263-y
Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Semi-infinite programming (90C34)
Related Items (2)
Mathematical programs with vanishing constraints involving strongly invex functions ⋮ Some results on mathematical programs 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
- Optimality and duality results for bilevel programming problem using convexifactors
- Duality for nonsmooth semi-infinite programming problems
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Semi-infinite programming
- Invexity and optimization
- On sufficiency of the Kuhn-Tucker conditions
- Solving nonlinear bilevel programming models of the equilibrium network design problem: A comparative review
- A generalized derivative for calm and stable functions
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Bilevel road pricing: theoretical analysis and optimality conditions
- On strong KKT type sufficient optimality conditions for nonsmooth multiobjective semi-infinite mathematical programming problems with equilibrium constraints
- Characterizations and applications of generalized invexity and monotonicity in Asplund spaces
- Optimality conditions in optimization problems with convex feasible set using convexificators
- An overview of bilevel optimization
- Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators
- Semi-Infinite Programming: Theory, Methods, and Applications
- Optimization and nonsmooth analysis
- Approximate subdifferentials and applications II
- A duality theorem for non-linear programming
- Invex functions and constrained local minima
- On vector optimization problems and vector variational inequalities using convexificators
- Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
- Multiobjective Problems: Enhanced Necessary Conditions and New Constraint Qualifications through Convexificators
- Convexifactors, generalized convexity and vector optimization
- The Linear Nonconvex Generalized Gradient and Lagrange Multipliers
- Mathematical Programs with Equilibrium Constraints
This page was built for publication: On semi-infinite mathematical programming problems with equilibrium constraints using generalized convexity
