Optimality conditions and duality in nondifferentiable minimax fractional programming with generalized convexity

Optimality conditions and duality in nondifferentiable minimax fractional programming with generalized convexity

0.00 Avg rating—0 Votes
Article ID: iaor20072577
Country: Netherlands
Volume: 129
Issue: 2
Start Page Number: 255
End Page Number: 275
Publication Date: May 2006
Journal: Journal of Optimization Theory and Applications
Authors: ,
Keywords: duality, minimax problem
Abstract:

We establish sufficient optimality conditions for a class of nondifferentiable minimax fractional programming problems involving (F, a, α, d)-convexity. Subsequently, we apply the optimality conditions to formulate two types of dual problems and prove appropriate duality theorems.

Reviews

Required fields are marked *. Your email address will not be published.