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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Computers & mathematics with applications (Oxford, England : 1987)
Paper Title
Journal
Date
