摘要
In this paper, a new second-order symmetric duality in multiobjective programming over arbitrary cones is fomulated. The weak, strong and converse duality theorems are proved for these programs under eta-invexity assumptions. Our results generalize these existing dual formulations which were discussed by the authors in [5, 6, 7, 8, 21].
- 出版日期2015-3
- 单位桂林电子科技大学; 湖南商学院