Higher-Order Mond-Weir Duality of Set-Valued Fractional Minimax Programming Problems

Abstract

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

Published
2024-10-07
How to Cite
DAS, Koushik. Higher-Order Mond-Weir Duality of Set-Valued Fractional Minimax Programming Problems. Yugoslav Journal of Operations Research, [S.l.], oct. 2024. ISSN 2334-6043. Available at: <https://yujor.fon.bg.ac.rs/index.php/yujor/article/view/1302>. Date accessed: 14 dec. 2024. doi: https://doi.org/10.2298/YJOR231215046D.
Section
Research Articles

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.