Saddle point and generalized convex duality for multiobjective programming
- Resource Type
- Article
- Authors
- Zhaoxiang Yan; Shizheng Li
- Source
- Journal of Applied Mathematics and Informatics, 15(0), pp.227-235 May, 2004
- Subject
- 수학
- Language
- ISSN
- 2234-8417
1598-5857
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.