1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://doi.org/10.1016/S0020-0255(02)00296-7
DC FieldValue
dc.titleConstraint ordinal optimization
dc.contributor.authorLi, D.
dc.contributor.authorLee, L.H.
dc.contributor.authorHo, Y.C.
dc.date.accessioned2014-06-17T06:59:45Z
dc.date.available2014-06-17T06:59:45Z
dc.date.issued2002-12
dc.identifier.citationLi, D., Lee, L.H., Ho, Y.C. (2002-12). Constraint ordinal optimization. Information Sciences 148 (1-4) : 201-220. ScholarBank@NUS Repository. https://doi.org/10.1016/S0020-0255(02)00296-7
dc.identifier.issn00200255
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/63066
dc.description.abstractOrdinal 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. © 2002 Elsevier Science Inc. All rights reserved.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1016/S0020-0255(02)00296-7
dc.sourceScopus
dc.subjectConstraint optimization
dc.subjectOptimization
dc.subjectOrdinal optimization
dc.subjectSimulation
dc.typeArticle
dc.contributor.departmentINDUSTRIAL & SYSTEMS ENGINEERING
dc.description.doi10.1016/S0020-0255(02)00296-7
dc.description.sourcetitleInformation Sciences
dc.description.volume148
dc.description.issue1-4
dc.description.page201-220
dc.description.codenISIJB
dc.identifier.isiut000179697000017
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.