Ordinal optimization
From Wikipedia, the free encyclopedia
Ordinal optimization is an approach for finding a solution to an optimization problem in which a large number of possible policies have to be considered. The objective is not necessarily to find the optimal solution but rather to select a policy that with a high probability is among the best policies Allen 1999.
[edit] See also
- Stochastic optimization
- Computational complexity theory
- Heuristics
- Operations research
- Discrete event simulation
- Queuing theory
[edit] References
- Ho, Y.C., Sreenivas, R., Vakili, P.,"Ordinal Optimization of Discrete Event Dynamic Systems", J. of DEDS 2(2), 61-88, (1992).
- Y. C. Ho,"Heuristics, Rules of Thumb, and the 80/20 Proposition" to appear IEEE Trans. on Automatic Control , Vol 39, #5, 1025-1027, May 1994
- Allen, Eric, and Marija D. Ilic. Price-Based Commitment Decisions in the Electricity Market. Advances in industrial control. London: Springer, 1999.
