On strong KKT type sufficient optimality conditions for multiobjective semi-infinite programming problems with vanishing constraints

Sy-Ming Guu; Yadvendra Singh; Shashi Kant Mishra

doi:10.1186/s13660-017-1558-x

On strong KKT type sufficient optimality conditions for multiobjective semi-infinite programming problems with vanishing constraints

J Inequal Appl. 2017;2017(1):282. doi: 10.1186/s13660-017-1558-x. Epub 2017 Nov 14.

Authors

Sy-Ming Guu^{1

2}, Yadvendra Singh³, Shashi Kant Mishra³

Affiliations

¹ Graduate Institute of Business and Management, College of Management, Chang Gung University, Kwei-Shan District, Taoyuan City, Taiwan, ROC.
² Department of Neurology, LinKou Chang Gung Memorial Hospital, Kwei-Shan District, Taoyuan City, Taiwan, ROC.
³ Department of Mathematics, Institute of Science, Banaras Hindu University, Varanasi, 221005 India.

Abstract

In this paper, we consider a nonsmooth multiobjective semi-infinite programming problem with vanishing constraints (MOSIPVC). We introduce stationary conditions for the MOSIPVCs and establish the strong Karush-Kuhn-Tucker type sufficient optimality conditions for the MOSIPVC under generalized convexity assumptions.

Keywords: generalized convexity; mathematical programs with vanishing constraints; optimality conditions; semi-infinite programming.