Lagrange duality and saddle point optimality conditions for semi-infinite mathematical programming problems with equilibrium constraints
DOI10.2298/YJOR181215014SzbMath1474.90483OpenAlexW2960097790WikidataQ127528679 ScholiaQ127528679MaRDI QIDQ3388451
J. K. Maurya, Kunwar V. K. Singh, Shashi Kant Mishra
Publication date: 5 May 2021
Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/yjor181215014s
dualitysaddle pointsemi-infinite programmingmathematical programming problems with equilibrium constraints
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)
Cites Work
- Unnamed Item
- 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
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- Necessary and sufficient conditions for nonsmooth mathematical programs with equilibrium constraints
- Semi-infinite programming
- A semi-infinite programming algorithm for solving optimal power flow with transient stability constraints
- Application of general semi-infinite programming to lapidary cutting problems
- Air pollution control with semi-infinite programming
- Bi-level strategies in semi-infinite programming.
- Saddle point optimality criteria for mathematical programming problems with equilibrium constraints
- Notes on some constraint qualifications for mathematical programs with equilibrium constraints
- How to solve a semi-infinite optimization problem
- Semi-infinite fractional programming
- Abadie-type constraint qualification for mathematical programs with equilibrium constraints
- On M-stationary points for mathematical programs with equilibrium constraints
- Semi-Infinite Programming: Theory, Methods, and Applications
- On the Guignard constraint qualification for mathematical programs with equilibrium constraints
- Semi-infinite programming, duality, discretization and optimality conditions†
- Optimal parametrization of curves for robot trajectory design
- Optimality Conditions and Duality for Semi-Infinite Mathematical Programming Problem with Equilibrium Constraints
- Mathematical programs with complementarity constraints in traffic and telecommunications networks
- Mathematical Programs with Equilibrium Constraints
- Semi-infinite transportation problems
- Semi-infinite programming. Recent advances
This page was built for publication: Lagrange duality and saddle point optimality conditions for semi-infinite mathematical programming problems with equilibrium constraints
