On Constrained Set-Valued Semi-Infinite Programming Problems with <i>ρ</i>-Cone Arcwise Connectedness

oleh: Koushik Das, Savin Treanţă

Format: Article
Diterbitkan: MDPI AG 2021-11-01

Deskripsi

In this paper, we establish sufficient Karush–Kuhn–Tucker (for short, KKT) conditions of a set-valued semi-infinite programming problem (SP) via the notion of contingent epiderivative of set-valued maps. We also derive duality results of Mond–Weir (MWD), Wolfe (WD), and mixed (MD) types of the problem (SP) under <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi>ρ</mi></semantics></math></inline-formula>-cone arcwise connectedness assumptions.