Constraint ordinal optimization

被引：21

作者：

Li, D

Lee, LH ^{[1
]}

Ho, YC

机构：

[1] Natl Univ Singapore, Dept Ind & Syst Engn, Singapore 119260, Singapore

[2] Harvard Univ, Div Engn & Appl Sci, Cambridge, MA 02138 USA

来源：

INFORMATION SCIENCES | 2002年 / 148卷 / 1-4期

关键词：

optimization; simulation; ordinal optimization; constraint optimization;

D O I：

10.1016/S0020-0255(02)00296-7

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Ordinal optimization has been developed as the solution to single performance measurement problem. However, in reality, multiple performance measures are required to solve optimization problems. Constraint optimization was developed so that single measure could be optimized while the remaining performance measures were used as constraints. In this paper, we will build a new framework and quantification methods for dealing with the constraint optimization problem. We call the framework constraint ordinal optimization. (C) 2002 Elsevier Science Inc. All rights reserved.

引用

页码：201 / 220

页数：20

共 23 条

[1]

DAI LY, 1997, J OPTIMIZATION THEOR, V91, P363

[2]

Deng M, 1999, AUTOMATICA, V35, P331, DOI 10.1016/S0005-1098(98)00155-1

[3]

Din DR, 2000, LECT NOTES COMPUT SC, V1961, P69

[4] A memetic algorithm for the total tardiness single machine scheduling problem [J].