Set-valued fractional programming problems with $ \sigma $-arcwisely connectivity

In this paper, we determine the sufficient Karush-Kuhn-Tucker (KKT) conditions of optimality of a set-valued fractional programming problem (in short, SVFP) $\rm (FP)$ under the suppositions of contingent epidifferentiation and $ \sigma $-arcwisely connectivity. We additionally explore the results o...

詳細記述

書誌詳細
出版年:AIMS Mathematics
主要な著者: Koushik Das, Savin Treanţă, Muhammad Bilal Khan
フォーマット: 論文
言語:英語
出版事項: AIMS Press 2023-04-01
主題:
オンライン・アクセス:https://www.aimspress.com/article/doi/10.3934/math.2023666?viewType=HTML