Towards finding global representations of the efficient set in multiple objective mathematical programming

被引：0
|
作者：
Benson, HP [1 ]
Sayin, S [1 ]
机构：
[1] BILKENT UNIV,FAC BUSINESS ADM,TR-06533 BILKENT,ANKARA,TURKEY
来源：
NAVAL RESEARCH LOGISTICS | 1997年 / 44卷 / 01期
关键词：
D O I：
10.1002/(SICI)1520-6750(199702)44:1<47::AID-NAV3>3.3.CO;2-K
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We propose and justify the proposition that finding truly global representations of the efficient sets of multiple objective mathematical programs is a worthy goal. We summarize the essential elements of a general global shooting procedure that seeks such representations. This procedure illustrates the potential benefits to be gained from procedures for globally representing efficient sets in multiple objective mathematical programming. (C) 1997 John Wiley & Sons, Inc.
引用
收藏
页码：47 / 67
页数：21
相关论文
共 50 条
12345