Sufficient optimality conditions and duality for strongly pseudo convex n-set problems

Sufficient optimality conditions and duality for strongly pseudo convex n-set problems

0.00 Avg rating0 Votes
Article ID: iaor19982440
Country: Belgium
Volume: 37
Start Page Number: 5
End Page Number: 15
Publication Date: Jan 1995
Journal: Cahiers du Centre d'tudes de Recherche Oprationnelle
Authors: ,
Keywords: programming: nonlinear
Abstract:

Sufficient optimality and duality results are established for discrete minimax problem involving n-set functions, with generalized ρ-convexity restrictions, either on sum of the components or on the linear combinations of the components.

Reviews

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