|
|||||
|
|
Saddle point and generalized convex duality for multiobjective programming |
|
| Authors: | Zhaoxiang Yan Shizheng Li |
| Affiliation: | 1. School of Science, Jinan University, 250022, Jinan, P. R. China 2. Department of Mathematics, Shandong Normal University, 250014, Jinan, P. R. China |
| Abstract: | 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. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |