Optimality and duality for robust semi-infinite nonsmooth multiobjective fractional programming under Univexity

The idea behind proposing a robust model in this article is its relevance to real-world scenarios where uncertainty appears in optimization problems. This paper aims to analyze semi-infinite nonsmooth multiobjective fractional programming problem with data uncertainty. To address the nonsmoothness o...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of applied mathematics & computing Ročník 71; číslo 5; s. 7463 - 7491
Hlavní autori: Sachdev, Geeta, Bagri, Ritu, Agarwal, Divya
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.10.2025
Springer Nature B.V
Predmet:
Computational Mathematics and Numerical Analysis
Efficiency
Linear programming
Mathematical and Computational Engineering
Mathematical programming
Mathematics
Mathematics and Statistics
Mathematics of Computing
Multiple objective analysis
Optimization
Original Research
Robustness
Theory of Computation
Uncertainty
Nonsmooth
90C46
Robust duality
Multiobjective programming
90C34
90C17
Semi-infinite
90C29
Fractional programming
ISSN:1598-5865, 1865-2085
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The idea behind proposing a robust model in this article is its relevance to real-world scenarios where uncertainty appears in optimization problems. This paper aims to analyze semi-infinite nonsmooth multiobjective fractional programming problem with data uncertainty. To address the nonsmoothness of functions, the functions involved are considered as directionally differentiable. Firstly, the robust necessary and sufficient optimality conditions are established under generalized univexity assumptions. For better comprehension of sufficiency results, an illustrative application is also provided. Further, a dual explored by a few authors: the Jagannathan type dual is formulated for the given primal problem. This dual has been explored due to its parametric form which can be solved with ease by a variety of computational approaches and hence, has potential applications in exploring various mathematical programming problems formulated in real life issues. Finally, the fundamental robust duality theorems namely weak, strong and strict converse duality are developed by employing the generalized univexity of the involved functions.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1598-5865
1865-2085
DOI:10.1007/s12190-025-02584-z