Some results on mathematical programs with equilibrium constraints
From MaRDI portal
Publication:2068831
DOI10.1007/s43069-021-00061-4zbMath1492.90173OpenAlexW3207176992MaRDI QIDQ2068831
Publication date: 20 January 2022
Published in: SN Operations Research Forum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s43069-021-00061-4
generalized invexitymathematical program with equilibrium constraintsWolfe-type dualMond-Weir-type dual
Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Invexity and optimization
- On sufficiency of the Kuhn-Tucker conditions
- Hierarchical optimization: An introduction
- Production and marketing decisions with multiple objectives in a competitive environment
- Complementarity constraint qualifications and simplified \(B\)-stationary conditions for mathematical programs with equilibrium constraints
- Bilevel and multilevel programming: A bibliography review
- Equilibrium problems and variational models. Based on the meeting, Erice, Italy, June 23--July 2, 2000
- Higher-order generalized invexity and duality in mathematical programming
- On bilevel programming. I: General nonlinear cases
- Complementarity formulations and existence of solutions of dynamic multi-rigid-body contact problems with Coulomb friction
- Non-cooperative games
- On semi-infinite mathematical programming problems with equilibrium constraints using generalized convexity
- Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
- On calmness conditions in convex bilevel programming
- Optimality Conditions for Disjunctive Programs Based on Generalized Differentiation with Application to Mathematical Programs with Equilibrium Constraints
- On nonsmooth mathematical programs with equilibrium constraints using generalized convexity
- What is invexity?
- Invex functions and constrained local minima
- Some Feasibility Issues in Mathematical Programs with Equilibrium Constraints
- A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions]
- Second order generalized invexity and duality in mathematical programming
- A Fritz John Approach to First Order Optimality Conditions for Mathematical Programs with Equilibrium Constraints
- Optimality Conditions for a Class of Mathematical Programs with Equilibrium Constraints
- Optimality and duality for nonsmooth semi-infinite mathematical program with equilibrium constraints involving generalized invexity of order σ > 0
- On generalized approximate convex functions and variational inequalities
- On \((p,r)\)-invexity-type nonlinear programming problems.
- Duality for nonsmooth mathematical programming problems with equilibrium constraints
This page was built for publication: Some results on mathematical programs with equilibrium constraints