Generalized pseudo univexity and duality in mathematical programming (Q5939124)

The authors consider the following problem: minimize \(f(x)\) subject to \(x\in C_1\) and \(g(x) \in C^*_2\), where \(C_1\subseteq \mathbb{R}^n\) and \(C_2\subseteq \mathbb{R}^m\) are closed convex cones with nonempty interiors, while \(f:C_1 \to\mathbb{R}\) and \(g:C_1 \to\mathbb{R}^m\). By using pseudo-univexity and quasi-univexity conditions they derive weak, strong and converse duality theorems concerning four dual problems associated with this problem.