A new class of generalized convex programming
- Resource Type
- Article
- Authors
- Zhaoxiang Yan; Shizheng Li
- Source
- Journal of Applied Mathematics and Informatics, 17(1-2), pp.351-360 Jan, 2005
- Subject
- 수학
- Language
- ISSN
- 2234-8417
1598-5857
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