DUALITY WITHOUT CONSTRAINT QUALIFICATION FOR MULTIOBJECTIVE PROGRAMMING

被引：6
|
作者：
EGUDO, RR
WEIR, T
MOND, B
机构：
[1] AUSTRALIAN DEF FORCE ACAD,DEPT MATH,CAMPBELL,ACT 2600,AUSTRALIA
[2] LA TROBE UNIV,DEPT MATH,BUNDOORA,VIC 3083,AUSTRALIA
来源：
JOURNAL OF THE AUSTRALIAN MATHEMATICAL SOCIETY SERIES B-APPLIED MATHEMATICS | 1992年 / 33卷
关键词：
D O I：
10.1017/S0334270000007219
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Extending earlier duality results for multiobjective programs, this paper defines dual problems for convex and generalised convex multiobjective programs without requiring a constraint qualification. The duals provide multiobjective extensions of the classical duals of Wolfe and Schechter and some of the more recent duals of Mond and Weir.
引用
收藏
页码：531 / 544
页数：14
相关论文
共 50 条
12345