http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
A new class of generalized convex programming
Zhaoxiang Yan,Shizheng Li 한국전산응용수학회 2005 Journal of applied mathematics & informatics Vol.17 No.1-2
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
Saddle point and generalized convex duality for multiobjective programming
Zhaoxiang Yan,Shizheng Li 한국전산응용수학회 2004 Journal of applied mathematics & informatics Vol.15 No.-
In this paper we consider the dual problems for multiobjec-tive programming with generalized convex functions. We obtain the weakduality and the strong duality. At last,we give an equivalent relationshipbetween saddle point and ecient solution in multiobjective programming.
A NEW CLASS OF GENERALIZED CONVEX PROGRAMMING
YAN, ZHAOXIANG,LI, SHIZHENG 한국전산응용수학회 2005 Journal of applied mathematics & informatics Vol.17 No.1
This paper finds a new class of generalized convex function which satisfies the following properties: It's level set is $\eta$-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.