Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/63246
Title: Ordinal optimization with subset selection rule
Authors: Yang, M.S.
Lee, L.H. 
Keywords: goal softening
Ordinal optimization
Issue Date: Jun-2002
Citation: Yang, M.S., Lee, L.H. (2002-06). Ordinal optimization with subset selection rule. Journal of Optimization Theory and Applications 113 (3) : 597-620. ScholarBank@NUS Repository.
Abstract: Ordinal optimization (OO) has enjoyed a great degree of success in addressing stochastic optimization problems characterized by an independent and identically distributed (i.i.d.) noise. The methodology offers a statistically quantifiable avenue to find good enough solutions by means of soft computation. In this paper, we extend the OO methodology to a more general class of stochastic problems by relaxing the i.i.d. assumption on the underlying noise. Theoretical results and their applications to simple examples are presented.
Source Title: Journal of Optimization Theory and Applications
URI: http://scholarbank.nus.edu.sg/handle/10635/63246
ISSN: 00223239
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

3
checked on Mar 5, 2018

WEB OF SCIENCETM
Citations

1
checked on Apr 30, 2018

Page view(s)

21
checked on Jun 8, 2018

Google ScholarTM

Check


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