Saddle point criteria in semi-infinite minimax fractional programming under (Φ,ρ)-invexity

Abstract

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.