Sufficient Optimality Conditions for Semi-Infinite Multiobjective Fractional Programming under ($\Phi,\rho$)-$V$-Invexity and Generalized ($\Phi,\rho$)-$V$-Invexity


Tadeusz Antczak




A new class of nonconvex smooth semi-infinite multiobjective fractional programming problems with both inequality and equality constraints is considered. We formulate and establish several parametric sufficient optimality conditions for efficient solutions in such nonconvex vector optimization problems under ($\Phi,\rho$)-$V$-invexity and/or generalized ($\Phi,\rho$)-$V$-invexity hypotheses. With the reference to the said functions, we extend some results of efficiency for a larger class of nonconvex smooth semi-infinite multiobjective programming problems in comparison to those ones previously established in the literature under other generalized convexity notions. Namely, we prove the sufficient optimality conditions for such nonconvex semi-infinite multiobjective fractional programming problems in which not all functions constituting them have the fundamental property of convexity, invexity and most generalized convexity notions.