Year: 2024
Type: article
Abstract: In this paper, we study the nondifferentiable generalized minimax fractional programming problem under (G, V )-invexity. G-sufficient optimality conditions for the considered nondifferentiable generalized minimax fractional programming problem are established under the concept of (G, V )-invexity. Further, two types of dual models are formulated and G-duality theorems relating to the primal minimax fractional programming problem and dual problems are established. These results extend several known results to a wider class of programs.
Source: RAIRO - Operations Research
DOI: 10.1051/ro/2024166
Authors: Jing Yuan, Xiangyou Li
Institution: Yan'an University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4401633693