Higher-Order Mond-Weir Duality of Set-Valued Fractional Minimax Programming Problems
Yugoslav journal of operations research, Tome 35 (2025) no. 4, p. 749
Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
In this paper, we consider a set-valued fractional minimax programming problem (abbreviated as SVFMPP) (MFP), in which both the objective and constraint maps are set-valued. We use the concept of higher-order α-cone arcwisely connectivity, introduced by Das [1], as a generalization of higher-order cone arcwisely connected setvalued maps. We explore the higher-order Mond-Weir (MWD) form of duality based on the supposition of higher-order α-cone arcwisely connectivity and prove the associated higher-order converse, strong, and weak theorems of duality between the primary (MFP) and the analogous dual problem (MWD).
Keywords:
Contingent epiderivative, convex cone, arcwisely connectivity, duality, setvalued map
Koushik Das. Higher-Order Mond-Weir Duality of Set-Valued Fractional Minimax Programming Problems. Yugoslav journal of operations research, Tome 35 (2025) no. 4, p. 749 . http://geodesic.mathdoc.fr/item/YJOR_2025_35_4_a1/
@article{YJOR_2025_35_4_a1,
author = {Koushik Das},
title = {Higher-Order {Mond-Weir} {Duality} of {Set-Valued} {Fractional} {Minimax} {Programming} {Problems}},
journal = {Yugoslav journal of operations research},
pages = {749 },
year = {2025},
volume = {35},
number = {4},
language = {en},
url = {http://geodesic.mathdoc.fr/item/YJOR_2025_35_4_a1/}
}