Optimality Conditions and Duality for Semi-Infinite Mathematical Programming Problem with Equilibrium Constraints
Shashi Kant Mishra, M. C. Jaiswal · Numerical Functional Analysis and Optimization · 2015
This article considers a semi-infinite mathematical programming problem with equilibrium constraints (SIMPEC) defined as a semi-infinite mathematical programming problem with complementarity constraints. We establish necessary and sufficient optimality conditions for the (SIMPEC). We also formulate Wolfe- and Mond-Weir-type dual models for (SIMPEC) and establish weak, strong and strict converse duality theorems for (SIMPEC) and the corresponding dual problems under invexity assumptions.