Saddle point and generalized convex duality for multiobjective programming

被引：0

作者：

Yan Z. ^{[1
]}

Li S. ^{[2
]}

机构：

[1] School of Science, Jinan University, Jinan

[2] Department of Mathematics, Shandong Normal University

来源：

Journal of Applied Mathematics and Computing | 2004年 / 15卷 / 1-2期

关键词：

Constraint qualification; Efficient solution; Saddle point; Sublinear function;

D O I：

10.1007/BF02935757

中图分类号：

学科分类号：

摘要：

In this paper we consider the dual problems for multiobjective programming with generalized convex functions. We obtain the weak duality and the strong duality. At last,we give an equivalent relationship between saddle point and efficient solution in multiobjective programming.

引用

页码：227 / 235

页数：8