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.
On the effects of hard and soft equality constraints in the iterative outlier elimination procedure
