Please use this identifier to cite or link to this item:
|Title:||Multiple objectives satisficing under uncertainty||Authors:||Lam, S.-W.
|Issue Date:||Jan-2013||Citation:||Lam, S.-W., Ng, T.S., Sim, M., Song, J.-H. (2013-01). Multiple objectives satisficing under uncertainty. Operations Research 61 (1) : 214-227. ScholarBank@NUS Repository. https://doi.org/10.1287/opre.1120.1132||Abstract:||We propose a class of functions, called multiple objective satisficing (MOS) criteria, for evaluating the level of compliance of a set of objectives in meeting their targets collectively under uncertainty. The MOS criteria include the joint targets' achievement probability (joint success probability criterion) as a special case and also extend to situations when the probability distributions are not fully characterized. We focus on a class of MOS criteria that favors diversification, which has the potential to mitigate severe shortfalls in scenarios when any objective fails to achieve its target. Naturally, this class excludes joint success probability. We further propose the shortfall-aware MOS criterion (S-MOS), which is inspired by the probability measure and is diversification favoring. We also show how to build tractable approximations of the S-MOS criterion. Because the S-MOS criterion maximization is not a convex optimization problem, we propose improvement algorithms via solving sequences of convex optimization problems. We report encouraging computational results on a blending problem in meeting specification targets even in the absence of full probability distribution description. © 2013 INFORMS.||Source Title:||Operations Research||URI:||http://scholarbank.nus.edu.sg/handle/10635/51861||ISSN:||0030364X||DOI:||10.1287/opre.1120.1132|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.