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

Universal Alignment Probability Revisited

Author

Listed:
  • S.Y. Lin

    (National Chiao Tung University)

  • Y.C. Ho

    (Harvard University)

Abstract

In this note, we quantify and validate the representativeness of the uniformly sampled set N for the search space Θ and the use of universal alignment probability (UAP) curves.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:joptap:v:113:y:2002:i:2:d:10.1023_a:1014891211119
    DOI: 10.1023/A:1014891211119
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1014891211119
    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:1014891211119?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.

    References listed on IDEAS

    as
    1. Y-C Ho & C G Cassandras & C-H Chen & L Dai, 2000. "Ordinal optimisation and simulation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 51(4), pages 490-500, April.
    2. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. 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.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. 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.
    2. H. S. Chang, 2004. "Technical Note: On Ordinal Comparison of Policies in Markov Reward Processes," Journal of Optimization Theory and Applications, Springer, vol. 122(1), pages 207-217, July.
    3. 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.
    4. L. Jeff Hong & Barry L. Nelson, 2006. "Discrete Optimization via Simulation Using COMPASS," Operations Research, INFORMS, vol. 54(1), pages 115-129, February.
    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. H. S. Chang, 2005. "On the Probability of Correct Selection by Distributed Voting in Stochastic Optimization," Journal of Optimization Theory and Applications, Springer, vol. 125(1), pages 231-240, April.
    7. 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.
    8. Shing Chih Tsai & Tse Yang, 2017. "Rapid screening algorithms for stochastically constrained problems," Annals of Operations Research, Springer, vol. 254(1), pages 425-447, July.
    9. A K Miranda & E Del Castillo, 2011. "Robust parameter design optimization of simulation experiments using stochastic perturbation methods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(1), pages 198-205, January.
    10. Hyeong Soo Chang & Jiaqiao Hu, 2012. "On the Probability of Correct Selection in Ordinal Comparison over Dynamic Networks," Journal of Optimization Theory and Applications, Springer, vol. 155(2), pages 594-604, November.
    11. Michael C. Fu, 2002. "Feature Article: Optimization for simulation: Theory vs. Practice," INFORMS Journal on Computing, INFORMS, vol. 14(3), pages 192-215, August.
    12. Sudip Bhattacharjee & Hong Zhang & R. Ramesh & Dee H. Andrews, 2007. "A Decomposition and Guided Simulation Methodology for Large-Scale System Design: A Study in QoS-Capable Intranets with Fixed and Mobile Components," INFORMS Journal on Computing, INFORMS, vol. 19(3), pages 429-442, August.
    13. Shing Chih Tsai, 2013. "Rapid Screening Procedures for Zero-One Optimization via Simulation," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 317-331, May.
    14. Angun, M.E., 2004. "Black box simulation optimization : Generalized response surface methodology," Other publications TiSEM 2548e953-54ce-44e2-8c5b-7, Tilburg University, School of Economics and Management.
    15. Miguel Lejeune & François Margot, 2011. "Optimization for simulation: LAD accelerator," Annals of Operations Research, Springer, vol. 188(1), pages 285-305, August.
    16. Zelda B. Zabinsky & David D. Linz, 2023. "Hesitant adaptive search with estimation and quantile adaptive search for global optimization with noise," Journal of Global Optimization, Springer, vol. 87(1), pages 31-55, September.
    17. 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:113:y:2002:i:2:d:10.1023_a:1014891211119. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.