Title of article
Complex minimax programming under generalized type-I functions
Author/Authors
S.K. Mishra، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2005
Pages
11
From page
1
To page
11
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.
Journal title
Computers and Mathematics with Applications
Serial Year
2005
Journal title
Computers and Mathematics with Applications
Record number
920274
Link To Document