A new class of generalized convex programming.

Autor: Yan, Zhaoxiang, Li, Shizheng
Zdroj: Journal of Applied Mathematics & Computing; Mar2005, Vol. 17 Issue 1/2, p351-360, 10p
Abstrakt: This paper finds a new class of generalized convex function which satisfies the following properties: It's level set is η-convex set; Every feasible Kuhn-Tucker point is a global minimum; If Slater's constraint qualification holds, then every minimum point is Kuhn-Tucker point; Weak duality and strong duality hold between primal problem and it's Mond-Weir dual problem. [ABSTRACT FROM AUTHOR]
Databáze: Complementary Index