Article ID Journal Published Year Pages File Type
9662350 Computers & Mathematics with Applications 2005 11 Pages PDF
Abstract
We establish the Kuhn-Tucker type sufficient optimality conditions for complex minimax programming under generalized Type-I and related functions. Subsequently, we apply these optimality criteria to formulate two dual models. We also establish weak, strong, and strict converse duality theorems.
Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Preview
Complex minimax programming under generalized type-I functions
Authors
,