Duality in inexact fractional programming with set-inclusive constraints

1986 ◽  
Vol 50 (2) ◽  
pp. 279-288 ◽  
Author(s):  
R. N. Kaul ◽  
S. Kaur ◽  
V. Lyall
Filomat ◽  
2017 ◽  
Vol 31 (9) ◽  
pp. 2557-2574 ◽  
Author(s):  
Tadeusz Antczak

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