Minimax fractional programming under nonsmooth generalized \((\mathcal F,\rho, \theta)\)-d-univexity

DOI10.1016/j.jmaa.2006.05.062zbMath1275.90100MaRDI QIDQ864722

Cheng Li, Xiao Jin Zheng

Publication date: 12 February 2007

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmaa.2006.05.062

zbMATH Keywords

duality; sufficient optimality conditions; generalized convex functions; minimax fractional problem

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

90C46: Optimality conditions and duality in mathematical programming

90C32: Fractional programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiobjective duality with invexity
• On sufficiency of the Kuhn-Tucker conditions
• Nondifferentiable minimax fractional programming under generalized univexity
• Constraint qualifications in a class of nondifferentiable mathematical programming problems
• Optimality conditions and duality models for minmax fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho, \theta)\)-\(V\)-convex functions
• Nondifferentiable multiobjective programming under generalized \(d\)-univexity
• Three types dual model for minimax fractional programming
• Constraint qualification in a general class of nondifferentiable mathematical programming problems
• Lagrange multipliers saddle points and scalarizations in composite multiobjective nonsmooth programming
• Nondifferentiable optimization by smooth approximations
• Further Generalizations of Convexity in Mathematical Programming
• On generalised convex mathematical programming
• Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions