Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions

Optimization ◽  
1995 ◽  
Vol 32 (2) ◽  
pp. 95-125 ◽  
Author(s):  
G. J. Zalmai
Keyword(s):  
Optimality Conditions ◽  
Convex Functions ◽  
Fractional Programming ◽  
Generalized Fractional Programming

scholarly journals Optimality Conditions and Duality of Three Kinds of Nonlinear Fractional Programming Problems

2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Xiaomin Zhang ◽  
Zezhong Wu
Keyword(s):  
Optimality Conditions ◽  
Convex Functions ◽  
Fractional Programming ◽  
Objective Functions ◽  
Duality Results ◽  
Nonlinear Fractional Programming

Some assumptions for the objective functions and constraint functions are given under the conditions of convex and generalized convex, which are based on theF-convex,ρ-convex, and(F,ρ)-convex. The sufficiency of Kuhn-Tucker optimality conditions and appropriate duality results are proved involving(F,ρ)-convex,(F,α,ρ,d)-convex, and generalized(F,α,ρ,d)-convex functions.

Sign in / Sign up

Export Citation Format

Share Document