Minimax Fractional Programming for n-Set Functions and Mixed-Type Duality under Generalized Invexity

2008 ◽  
Vol 139 (2) ◽  
pp. 295-313 ◽  
Author(s):  
H. C. Lai ◽  
T. Y. Huang
Keyword(s):  
Fractional Programming ◽  
Mixed Type ◽  
Generalized Invexity ◽  
Set Functions ◽  
Minimax Fractional Programming ◽  
Mixed Type Duality

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

Filomat ◽  
2017 ◽  
Vol 31 (9) ◽  
pp. 2557-2574 ◽  
Author(s):  
Tadeusz Antczak
Keyword(s):  
Saddle Point ◽  
Fractional Programming ◽  
Generalized Convexity ◽  
Equality Constraints ◽  
New Class ◽  
Minimax Fractional Programming

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.

Sign in / Sign up

Export Citation Format

Share Document