Complex minimax programming under generalized convexity

作者：

Highlights：

•

摘要

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.

论文关键词：Minimax programming,Generalized invex function,Duality theorem

论文评审过程：Received 15 May 2003, Revised 4 August 2003, Available online 20 January 2004.

论文官网地址：https://doi.org/10.1016/j.cam.2003.09.045