scholarly journals Complementarity Active-Set Algorithm for Mathematical Programming Problems with Equilibrium Constraints

2007 ◽  
Vol 134 (3) ◽  
pp. 467-481 ◽  
Author(s):  
J. J. Júdice ◽  
H. D. Sherali ◽  
I. M. Ribeiro ◽  
A. M. Faustino
Keyword(s):  
Mathematical Programming ◽  
Equilibrium Constraints ◽  
Active Set ◽  
Active Set Algorithm ◽  
Mathematical Programming Problems

scholarly journals Lagrange duality and saddle point optimality conditions for semi-infinite mathematical programming problems with equilibrium constraints

2019 ◽  
Vol 29 (4) ◽  
pp. 433-448
Author(s):  
Kunwar Singh ◽  
J.K. Maurya ◽  
S.K. Mishra
Keyword(s):  
Mathematical Programming ◽  
Saddle Point ◽  
Optimality Conditions ◽  
Optimization Problems ◽  
Inequality Constraints ◽  
Mathematical Programming Problem ◽  
Dual Model ◽  
Equilibrium Constraints ◽  
Convexity Assumptions ◽  
Mathematical Programming Problems

In this paper, we consider a special class of optimization problems which contains infinitely many inequality constraints and finitely many complementarity constraints known as the semi-infinite mathematical programming problem with equilibrium constraints (SIMPEC). We propose Lagrange type dual model for the SIMPEC and obtain their duality results using convexity assumptions. Further, we discuss the saddle point optimality conditions for the SIMPEC. Some examples are given to illustrate the obtained results.

Sign in / Sign up

Export Citation Format

Share Document