AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
Powered by AMiner. Clicking this button will take you away from SciOpen.
Home AIMS Mathematics Article
PDF (294.8 KB)
Cite
EndNote(RIS) BibTeX
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

Set-valued fractional programming problems with σ-arcwisely connectivity

Koushik Das1, Savin Treanţă2,3,4( ), Muhammad Bilal Khan5( )
Department of Mathematics, Taki Government College, Taki 743429, West Bengal, India
Department of Applied Mathematics, University Politehnica of Bucharest, 060042 Bucharest, Romania
Academy of Romanian Scientists, 54 Splaiul Independentei, 050094 Bucharest, Romania
Fundamental Sciences Applied in Engineering-Research Center (SFAI), University Politehnica of Bucharest, 060042 Bucharest, Romania
Department of Mathematics, COMSATS University Islamabad, Islamabad 44000, Pakistan
Show Author Information

Abstract

In this paper, we determine the sufficient Karush-Kuhn-Tucker (KKT) conditions of optimality of a set-valued fractional programming problem (in short, SVFP) ( F P ) under the suppositions of contingent epidifferentiation and σ-arcwisely connectivity. We additionally explore the results of duality of parametric ( P D ), Mond-Weir ( M W D ), Wolfe ( W D ), and mixed ( M D ) kinds for the problem ( F P ).

Keywords

set-valued mapconvex conecontingent epidifferentiationduality
CLC number: 26B25, 49N15

References

【1】
【1】
 
 
Crossref Google Scholar
AIMS Mathematics
Volume 8 Issue 6,
June 2023
Pages 13181-13204
DOI: 10.3934/math.2023666

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Cite this Report
Close
Close
Cite this article:
Das K, Treanţă S, Khan MB. Set-valued fractional programming problems with σ-arcwisely connectivity. AIMS Mathematics, 2023, 8(6): 13181-13204. https://doi.org/10.3934/math.2023666

78

Views

1

Downloads

4

Crossref

2

Web of Science

2

Scopus
Received: 31 October 2022
Revised: 12 March 2023
Accepted: 23 March 2023
Published: 15 June 2023
©2023 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)