Nonsmooth minimax fractional programming involvingη-pseudolinear functions

Optimization ◽  
2012 ◽  
Vol 63 (5) ◽  
pp. 775-788 ◽  
Author(s):  
S.K. Mishra ◽  
B.B. Upadhyay
Filomat ◽  
2017 ◽  
Vol 31 (9) ◽  
pp. 2557-2574 ◽  
Author(s):  
Tadeusz Antczak

Semi-infinite minimax fractional programming problems with both inequality and equality constraints are considered. The sets of parametric saddle point conditions are established for a new class of nonconvex differentiable semi-infinite minimax fractional programming problems under(?,?)-invexity assumptions. With the reference to the said concept of generalized convexity, we extend some results of saddle point criteria for a larger class of nonconvex semi-infinite minimax fractional programming problems in comparison to those ones previously established in the literature.


2011 ◽  
Vol 2011 ◽  
pp. 1-19 ◽  
Author(s):  
Anurag Jayswal

We establish several sufficient optimality conditions for a class of nondifferentiable minimax fractional programming problems from a view point of generalized convexity. Subsequently, these optimality criteria are utilized as a basis for constructing dual models, and certain duality results have been derived in the framework of generalized convex functions. Our results extend and unify some known results on minimax fractional programming problems.


Sign in / Sign up

Export Citation Format

Share Document