文章基本信息

标题：Lagrange duality and saddle point optimality conditions for semi-infinite mathematical programming problems with equilibrium constraints
本地全文：下载
作者：Singh, Kunwar V.K. ; Maurya, J.K. ; Mishra, S.K. 等
期刊名称：Yugoslav Journal of Operations Research
印刷版ISSN：0354-0243
电子版ISSN：1820-743X
出版年度：2019
卷号：29
期号：4
页码：433-448
DOI：10.2298/YJOR181215014S
出版社：Faculty of Organizational Sciences, Belgrade, Mihajlo Pupin Institute, Belgrade, Economics Institute, Belgrade, Faculty of Transport and Traffic Engineering, Belgrade, Faculty of Mechanical Engineering, Belgrade
摘要：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.
关键词：Mathematical programming problems with equilibrium constraints; Duality; Saddle point; Semi-infinite programming