GENERALIZED MINIMAX FRACTIONAL PROGRAMMING PROBLEMS WITH GENERALIZED NONSMOOTH $(F, ALPHA, RHO, D, THETA)$-UNIVEX FUNCTIONS

ANURAG  JAYSWAL; IOAN  STANCU-MINASIAN; I.  AHMAD; KRISHNA  KUMMARI

GENERALIZED MINIMAX FRACTIONAL PROGRAMMING PROBLEMS WITH GENERALIZED NONSMOOTH $(F, ALPHA, RHO, D, THETA)$-UNIVEX FUNCTIONS

Authors

ANURAG JAYSWAL Indian School of Mines, Dhanbad, India
IOAN STANCU-MINASIAN Institute of Mathematical Statistics and Applied Mathematics of the Romanian Academy, Calea 13 Septembrie, No.13, 050711 Bucharest 5, Romania
I. AHMAD Department of Mathematics and Statistics, King Fahd University of Petroleum and Minerals, P.O. Box 728, Dhahran 31261, Saudi Arabia
KRISHNA KUMMARI Department of Applied Mathematics, Indian School of Mines, Dhanbad-826 004, India

Keywords:

Generalized minimax fractional programming, (F,α,ρ,d,θ)-univexity, Sufficient optimality conditions, Duality

Abstract

The aim of this paper is to establish the sufficient optimality conditions for a class of nondifferentiable multiobjective generalized minimax fractional programming problems involving univex functions. Subsequently, we apply the optimality condition to formulate a dual model and prove weak, strong and strict converse duality theorems.