Minmax fractional programming problem involving generalized convex functions

In the present study we focus our attention on a minmax fractional programming problem and its second order dual problem. Duality results are obtained for the considered dual problem under the assumptions of second order \(\left( {F,\alpha ,\rho ,d}\right) \) -type I functions.

Bibliographic Details
Main Authors: Anurag Jayswal, I.M. Stancu-Minasian, Dilip Kumar
Format: Article
Language:English
Published: Publishing House of the Romanian Academy 2012-01-01
Series:Journal of Numerical Analysis and Approximation Theory
Subjects:
Online Access:https://www.ictp.acad.ro/jnaat/journal/article/view/968