IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v93y1997i3d10.1023_a1022614327007.html
   My bibliography  Save this article

Universal Alignment Probabilities and Subset Selection for Ordinal Optimization

Author

Listed:
  • T. W. Edward Lau

    (Harvard University)

  • Y. C. Ho

    (Harvard University)

Abstract

We examine in this paper the subset selection procedure in the context of ordinal optimization introduced in Ref. 1. Major concepts including goal softening, selection subset, alignment probability, and ordered performance curve are formally introduced. A two-parameter model is devised to calculate alignment probabilities for a wide range of cases using two different selection rules: blind pick and horse race. Our major result includes the suggestion of quantifiable subset selection sizes which are universally applicable to many simulation and modeling problems, as demonstrated by the examples in this paper.

Suggested Citation

  • T. W. Edward Lau & Y. C. Ho, 1997. "Universal Alignment Probabilities and Subset Selection for Ordinal Optimization," Journal of Optimization Theory and Applications, Springer, vol. 93(3), pages 455-489, June.
    • Handle: RePEc:spr:joptap:v:93:y:1997:i:3:d:10.1023_a:1022614327007
    DOI: 10.1023/A:1022614327007
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1022614327007
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1022614327007?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. S.-C. Horng & S.-Y. Lin, 2009. "Ordinal Optimization of G/G/1/K Polling Systems with k-Limited Service Discipline," Journal of Optimization Theory and Applications, Springer, vol. 140(2), pages 213-231, February.
    2. S.Y. Lin & Y.C. Ho, 2002. "Universal Alignment Probability Revisited," Journal of Optimization Theory and Applications, Springer, vol. 113(2), pages 399-407, May.
    3. Vladimir I. Norkin & Yuri M. Ermoliev & Andrzej Ruszczyński, 1998. "On Optimal Allocation of Indivisibles Under Uncertainty," Operations Research, INFORMS, vol. 46(3), pages 381-395, June.
    4. M.S. Yang & L.H. Lee, 2002. "Ordinal Optimization with Subset Selection Rule," Journal of Optimization Theory and Applications, Springer, vol. 113(3), pages 597-620, June.
    5. Junjie Jia & Nan Yang & Chao Xing & Haoze Chen & Songkai Liu & Yuehua Huang & Binxin Zhu, 2019. "An Improved Constrained Order Optimization Algorithm for Uncertain SCUC Problem Solving," Energies, MDPI, vol. 12(23), pages 1-19, November.
    6. Q. C. Zhao & Y. C. Ho & Q. S. Jia, 2005. "Vector Ordinal Optimization," Journal of Optimization Theory and Applications, Springer, vol. 125(2), pages 259-274, May.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:93:y:1997:i:3:d:10.1023_a:1022614327007. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.