Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지

A NEW CLASS OF GENERALIZED CONVEX PROGRAMMING

  • YAN ZHAOXIANG (School of Science, Jinan University) ;
  • LI SHIZHENG (Department of Mathematics, Shandong Normal University)
  • Published : 2005.01.01

⟨ Previous Next ⟩

Abstract

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.

Keywords