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

Authors

  • A. Jayswal Indian School of MInes, Dhanbad, India
  • I. 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
  • K. Kummari Department of Applied Mathematics, Indian School of Mines, Dhanbad-826 004, India

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.

Downloads

Published

2013-08-09

How to Cite

Jayswal, A., Minasian, I., Ahmad, I., & Kummari, K. (2013). GENERALIZED MINIMAX FRACTIONAL PROGRAMMING PROBLEMS WITH GENERALIZED NONSMOOTH $(F, ALPHA, RHO, D, THETA)$-UNIVEX FUNCTIONS. Journal of Nonlinear Analysis and Optimization: Theory & Applications, 4(2), 227-239. Retrieved from http://www.math.sci.nu.ac.th/ojs302/index.php/jnao/article/view/256

Issue

Section

Research Article