Duality Theorems for Quasiconvex Programming with a Reverse Quasiconvex Constraint
Duality Theorems for Quasiconvex Programming with a Reverse Quasiconvex Constraint
复制标题
具有逆拟凸约束的拟凸规划的对偶定理
DOI：
10.11650/tjm/7256
复制
发表时间：
2017
影响因子：
0.4
通讯作者：
Suzuki Satoshi
中科院分区：
文献类型：
--
作者：
Luiz Faria;Olimpio Miyagaki;Mieko Tanaka;Mieko Tanaka;Mieko Tanaka;Mieko Tanaka;田中 視英子;田中 視英子;Toshimichi Usuba;Toshimichi Usuba;Toshimichi Usuba;Suzuki Satoshi
In this paper, we study duality theorems for quasiconvex programming with a reverse quasiconvex constraint. We introduce quasiaffine transformation methods for a reverse quasiconvex constraint. Especially, we show a linear characterization of a reverse quasiconvex constraint. By using transformation methods, we show necessary optimality conditions in terms of Greenberg-Pierskalla subdifferential. In addition, we introduce a surrogate duality theorem for quasiconvex programming with a reverse quasiconvex constraint.
