IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v59y2012i3-4p278-284.html
   My bibliography  Save this article

A note on optimal allocations for the second elementary symmetric function with applications for optimal reliability design

Author

Listed:
  • Chien‐Yu Peng

Abstract

This article considers the problem of determining the optimal size allocation and optimal number of experimental conditions for a second elementary symmetric function with different coefficients. Analytical solutions for several practical applications are derived and the general formulation is used to elucidate the foundation between different parametric models found in recent studies. A geometrical interpretation of the structure of some theoretical results is also provided. This approach renders some complex problems more tractable than what numerical search algorithms would allow. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012

Suggested Citation

  • Chien‐Yu Peng, 2012. "A note on optimal allocations for the second elementary symmetric function with applications for optimal reliability design," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(3‐4), pages 278-284, April.
    • Handle: RePEc:wly:navres:v:59:y:2012:i:3-4:p:278-284
    DOI: 10.1002/nav.21487
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.21487
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.21487?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
    ---><---

    References listed on IDEAS

    as
    1. Ulrike Graßhoff & Rainer Schwabe, 2008. "Optimal design for the Bradley–Terry paired comparison model," Statistical Methods & Applications, Springer;Società Italiana di Statistica, vol. 17(3), pages 275-289, July.
    2. Ravindran, A. & Lee, Harvey K., 1981. "Computer experiments on quadratic programming algorithms," European Journal of Operational Research, Elsevier, vol. 8(2), pages 166-174, October.
    3. H. K. T. Ng & N. Balakrishnan & P. S. Chan, 2007. "Optimal sample size allocation for tests with multiple levels of stress with extreme value regression," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(3), pages 237-249, April.
    4. Patriksson, Michael, 2008. "A survey on the continuous nonlinear resource allocation problem," European Journal of Operational Research, Elsevier, vol. 185(1), pages 1-46, February.
    5. C. E. Lemke, 1965. "Bimatrix Equilibrium Points and Mathematical Programming," Management Science, INFORMS, vol. 11(7), pages 681-689, May.
    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. I‐Chen Lee & Sheng‐Tsaing Tseng & Yili Hong, 2020. "Global planning of accelerated degradation tests based on exponential dispersion degradation models," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(6), pages 469-483, September.

    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. Zhang, Bin, 2012. "Multi-tier binary solution method for multi-product newsvendor problem with multiple constraints," European Journal of Operational Research, Elsevier, vol. 218(2), pages 426-434.
    2. Weiyang Ding & Michael K. Ng & Wenxing Zhang, 2024. "A generalized alternating direction implicit method for consensus optimization: application to distributed sparse logistic regression," Journal of Global Optimization, Springer, vol. 90(3), pages 727-753, November.
    3. Jungho Park & Hadi El-Amine & Nevin Mutlu, 2021. "An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1213-1228, July.
    4. Talman, A.J.J. & van der Heyden, L., 1981. "Algorithms for the linear complementarity problem which allow an arbitrary starting point," Research Memorandum FEW 99, Tilburg University, School of Economics and Management.
    5. Bernhard von Stengel & Antoon van den Elzen & Dolf Talman, 2002. "Computing Normal Form Perfect Equilibria for Extensive Two-Person Games," Econometrica, Econometric Society, vol. 70(2), pages 693-715, March.
    6. Richard Asmuth, 1978. "Studying Economic Equilibria on Affine Networks Via Lemke's Algorithm," Discussion Papers 314, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    7. Porter, Ryan & Nudelman, Eugene & Shoham, Yoav, 2008. "Simple search methods for finding a Nash equilibrium," Games and Economic Behavior, Elsevier, vol. 63(2), pages 642-662, July.
    8. Zhe Liu & Yahya Fathi, 2012. "The nearest point problem in a polyhedral set and its extensions," Computational Optimization and Applications, Springer, vol. 53(1), pages 115-130, September.
    9. S. R. Mohan, 1997. "Degeneracy Subgraph of the Lemke Complementary Pivot Algorithm and Anticycling Rule," Journal of Optimization Theory and Applications, Springer, vol. 94(2), pages 409-423, August.
    10. Jacobovic, Royi & Kella, Offer, 2020. "Minimizing a stochastic convex function subject to stochastic constraints and some applications," Stochastic Processes and their Applications, Elsevier, vol. 130(11), pages 7004-7018.
    11. Bidard, Christian, 2014. "The Ricardian rent theory: an overview," Centro Sraffa Working Papers CSWP8, Centro di Ricerche e Documentazione "Piero Sraffa".
    12. Sathaye, Nakul & Madanat, Samer, 2012. "A bottom-up optimal pavement resurfacing solution approach for large-scale networks," Transportation Research Part B: Methodological, Elsevier, vol. 46(4), pages 520-528.
    13. Sathaye, Nakul & Madanat, Samer, 2011. "A bottom-up solution for the multi-facility optimal pavement resurfacing problem," Transportation Research Part B: Methodological, Elsevier, vol. 45(7), pages 1004-1017, August.
    14. A. T. Phillips & J. B. Rosen, 1990. "Guaranteed ϵ‐approximate solution for indefinite quadratic global minimization," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(4), pages 499-514, August.
    15. Martijn H. H. Schoot Uiterkamp & Marco E. T. Gerards & Johann L. Hurink, 2022. "On a Reduction for a Class of Resource Allocation Problems," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1387-1402, May.
    16. van der Laan, G. & Talman, A.J.J. & Yang, Z.F., 2005. "Computing Integral Solutions of Complementarity Problems," Other publications TiSEM b8e0c74e-2219-4ab0-99a2-0, Tilburg University, School of Economics and Management.
    17. Christian Bidard, 2015. "An oddity property for cross-dual games," EconomiX Working Papers 2015-4, University of Paris Nanterre, EconomiX.
    18. van der Laan, G. & Talman, A.J.J. & Yang, Z.F., 2007. "A vector labeling method for solving discrete zero point and complementarity problems," Other publications TiSEM 070869d0-4e42-4d34-85f9-b, Tilburg University, School of Economics and Management.
    19. Strang, Kenneth David, 2012. "Importance of verifying queue model assumptions before planning with simulation software," European Journal of Operational Research, Elsevier, vol. 218(2), pages 493-504.
    20. Itay Gurvich & Ward Whitt, 2009. "Scheduling Flexible Servers with Convex Delay Costs in Many-Server Service Systems," Manufacturing & Service Operations Management, INFORMS, vol. 11(2), pages 237-253, June.

    More about this item

    Statistics

    Access and download statistics

    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:wly:navres:v:59:y:2012:i:3-4:p:278-284. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.