Nondifferentiable minimax fractional programming under generalized univexity

DOI10.1016/S0377-0427(03)00455-2zbMath1030.90127MaRDI QIDQ1410872

D. Massart

Publication date: 15 October 2003

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Duality; Sufficient conditions; Nondifferentiable minimax fractional problem; Univexity

Mathematics Subject Classification ID

90C32: Fractional programming

49J35: Existence of solutions for minimax problems

26A51: Convexity of real functions in one variable, generalizations

Related Items

Multiple objective fractional programming involving semilocally type I-preinvex and related functions

Cites Work

• On duality theorems for a nondifferentiable minimax fractional programming
• On sufficiency of the Kuhn-Tucker conditions
• Second order duality for a minimax programming problem
• Necessary conditions and sufficient conditions for static minmax problems
• On minimax fractional optimality conditions with invexity
• Necessary and sufficient conditions for minimax fractional programming
• Optimality criteria and duality in multiple-objective optimization involving generalized invexity
• Constrained vector valued ratio games and generalized subdifferentiable multiobjective fractional minmax programming
• Pseudolinear fractional minmax programming
• Generalized pseudo-convex minmax programming.
• Duality for fractional minimax programming problems
• Further Generalizations of Convexity in Mathematical Programming
• On generalised convex mathematical programming
• Generalized fractional programming problems containing locally subdifferentiable andρ-Univex functions
• Duality for minmax programming involvingV-invex functions
• Pseudoconvex complex minimax programming
• Multiobjective programming under generalized type I invexity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item