Minimax fractional programming involving generalised invex functions
Keyword(s):
AbstractThe convexity assumptions for a minimax fractional programming problem of variational type are relaxed to those of a generalised invexity situation. Sufficient optimality conditions are established under some specific assumptions. Employing the existence of a solution for the minimax variational fractional problem, three dual models, the Wolfe type dual, the Mond-Weir type dual and a one parameter dual type, are constructed. Several duality theorems concerning weak, strong and strict converse duality under the framework of invexity are proved.
2020 ◽
Vol 11
◽
pp. 17
2007 ◽
Vol 23
(1-2)
◽
pp. 1-23
◽
2002 ◽
Vol 146
(1)
◽
pp. 115-126
◽
2021 ◽