Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming under (Φ, ρ)-Invexity

被引:5
|
作者
Antczak, Tadeusz [1 ]
机构
[1] Univ Lodz, Fac Math & Comp Sci, Banacha 22, PL-90238 Lodz, Poland
关键词
semi-infinite minimax fractional programming; saddle point; vector-valued Lagrange function; (Phi; rho)-invex function; GENERALIZED; (ETA; RHO)-INVEX FUNCTIONS; SUFFICIENT OPTIMALITY CONDITIONS; MULTIOBJECTIVE PROGRAMS; R)-INVEX FUNCTIONS; CONVEX-FUNCTIONS; DUALITY; INVEXITY; OPTIMIZATION; B-(P; SETS;
D O I
10.2298/FIL1709557A
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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 (Phi, rho)-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.
引用
收藏
页码:2557 / 2574
页数:18
相关论文
共 50 条