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...

Full description

Bibliographic Details
Main Authors: Koushik Das, Savin Treanţă, Muhammad Bilal Khan
Format: Article
Language:English
Published: AIMS Press 2023-04-01
Series:AIMS Mathematics
Subjects:
Online Access:https://www.aimspress.com/article/doi/10.3934/math.2023666?viewType=HTML