Title of article
Complex minimax programming under generalized convexity
Author/Authors
Mishra، نويسنده , , S.K. and Wang، نويسنده , , S.Y. and Lai، نويسنده , , K.K.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
13
From page
59
To page
71
Abstract
We establish the Kuhn–Tucker-type sufficient optimality conditions for complex minimax programming under generalized invex functions. Subsequently, we apply these optimality criteria to formulate two dual models. We also establish weak, strong and strict converse duality theorems.
Keywords
Minimax programming , Generalized invex function , Duality theorem
Journal title
Journal of Computational and Applied Mathematics
Serial Year
2004
Journal title
Journal of Computational and Applied Mathematics
Record number
1552553
Link To Document