Second order duality for nondifferentiable minimax programming problems with generalized convexity

Second order duality for nondifferentiable minimax programming problems with generalized convexity

0.00 Avg rating0 Votes
Article ID: iaor200971254
Country: Netherlands
Volume: 44
Issue: 4
Start Page Number: 593
End Page Number: 608
Publication Date: Aug 2009
Journal: Journal of Global Optimization
Authors: , ,
Keywords: duality, minimax problem
Abstract:

In this paper, we are concerned with a class of nondifferentiable minimax programming problem and its two types of second order dual models. Weak, strong and strict converse duality theorems from a view point of generalized convexity are established. Our study naturally unifies and extends some previously known results on minimax programming.

Reviews

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