IDEAS home Printed from https://ideas.repec.org/a/eee/csdana/v49y2005i3p837-848.html
   My bibliography  Save this article

Stochastic programming methods in the response surface methodology

Author

Listed:
  • Diaz-Garcia, Jose A.
  • Ramos-Quiroga, Rogelio
  • Cabrera-Vicencio, Enrique

Abstract

No abstract is available for this item.

Suggested Citation

  • Diaz-Garcia, Jose A. & Ramos-Quiroga, Rogelio & Cabrera-Vicencio, Enrique, 2005. "Stochastic programming methods in the response surface methodology," Computational Statistics & Data Analysis, Elsevier, vol. 49(3), pages 837-848, June.
    • Handle: RePEc:eee:csdana:v:49:y:2005:i:3:p:837-848
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167-9473(04)00179-3
    Download Restriction: Full text for ScienceDirect subscribers only.
    ---><---

    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. A. Charnes & W. W. Cooper, 1963. "Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints," Operations Research, INFORMS, vol. 11(1), pages 18-39, February.
    2. Angun, M.E. & Gürkan, G. & den Hertog, D. & Kleijnen, J.P.C., 2002. "Response surface methodology revisited," Other publications TiSEM 32c35a04-3de9-4dee-a242-6, Tilburg University, School of Economics and Management.
    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. Ali Salmasnia & Mostafa Khatami & Reza Kazemzadeh & Seyed Zegordi, 2015. "Bi-objective single machine scheduling problem with stochastic processing times," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(1), pages 275-297, April.
    2. Diaz-Garcia, Jose A. & Garay-Tapia, Ma. Magdalena, 2007. "Optimum allocation in stratified surveys: Stochastic programming," Computational Statistics & Data Analysis, Elsevier, vol. 51(6), pages 3016-3026, March.

    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. Hang Li & Zhe Zhang & Xianggen Yin & Buhan Zhang, 2020. "Preventive Security-Constrained Optimal Power Flow with Probabilistic Guarantees," Energies, MDPI, vol. 13(9), pages 1-13, May.
    2. Bilsel, R. Ufuk & Ravindran, A., 2011. "A multiobjective chance constrained programming model for supplier selection under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 45(8), pages 1284-1300, September.
    3. Glover, Fred & Sueyoshi, Toshiyuki, 2009. "Contributions of Professor William W. Cooper in Operations Research and Management Science," European Journal of Operational Research, Elsevier, vol. 197(1), pages 1-16, August.
    4. Zervopoulos, Panagiotis & Emrouznejad, Ali & Sklavos, Sokratis, 2019. "A Bayesian approach for correcting bias of data envelopment analysis estimators," MPRA Paper 91886, University Library of Munich, Germany.
    5. R. Caballero & E. Cerda & M. Muñoz & L. Rey, 2002. "Analysis and comparisons of some solution concepts for stochastic programming problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 10(1), pages 101-123, June.
    6. Hongmin Li & Stephen C. Graves & Woonghee Tim Huh, 2014. "Optimal Capacity Conversion for Product Transitions Under High Service Requirements," Manufacturing & Service Operations Management, INFORMS, vol. 16(1), pages 46-60, February.
    7. Wenqing Chen & Melvyn Sim, 2009. "Goal-Driven Optimization," Operations Research, INFORMS, vol. 57(2), pages 342-357, April.
    8. Ann M. Campbell & Barrett W. Thomas, 2008. "Probabilistic Traveling Salesman Problem with Deadlines," Transportation Science, INFORMS, vol. 42(1), pages 1-21, February.
    9. Cigdem Z. Gurgur & Charles T. Morley, 2008. "Lockheed Martin Space Systems Company Optimizes Infrastructure Project-Portfolio Selection," Interfaces, INFORMS, vol. 38(4), pages 251-262, August.
    10. O. Olesen, 2006. "Comparing and Combining Two Approaches for Chance Constrained DEA," Journal of Productivity Analysis, Springer, vol. 26(2), pages 103-119, October.
    11. Gong, Jiangyue & Gujjula, Krishna Reddy & Ntaimo, Lewis, 2023. "An integrated chance constraints approach for optimal vaccination strategies under uncertainty for COVID-19," Socio-Economic Planning Sciences, Elsevier, vol. 87(PA).
    12. Taylan G. Topcu & Konstantinos Triantis, 2022. "An ex-ante DEA method for representing contextual uncertainties and stakeholder risk preferences," Annals of Operations Research, Springer, vol. 309(1), pages 395-423, February.
    13. Maji, Chandi Charan, 1975. "Intertemporal allocation of irrigation water in the Mayurakshi Project (India): an application of deterministic and chance-constrained linear programming," ISU General Staff Papers 197501010800006381, Iowa State University, Department of Economics.
    14. Kou, Peng & Gao, Feng & Guan, Xiaohong, 2015. "Stochastic predictive control of battery energy storage for wind farm dispatching: Using probabilistic wind power forecasts," Renewable Energy, Elsevier, vol. 80(C), pages 286-300.
    15. Engau, Alexander & Sigler, Devon, 2020. "Pareto solutions in multicriteria optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 281(2), pages 357-368.
    16. Yongjia Song & Minjiao Zhang, 2015. "Chance‐constrained multi‐terminal network design problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(4), pages 321-334, June.
    17. Bora Tarhan & Ignacio Grossmann & Vikas Goel, 2013. "Computational strategies for non-convex multistage MINLP models with decision-dependent uncertainty and gradual uncertainty resolution," Annals of Operations Research, Springer, vol. 203(1), pages 141-166, March.
    18. C. Lovell & Shawna Grosskopf & Eduardo Ley & Jesús Pastor & Diego Prior & Philippe Eeckaut, 1994. "Linear programming approaches to the measurement and analysis of productive efficiency," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 2(2), pages 175-248, December.
    19. Yongjia Song & James R. Luedtke & Simge Küçükyavuz, 2014. "Chance-Constrained Binary Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 26(4), pages 735-747, November.
    20. Arjang Assad & Weixuan Xu, 1992. "The quadratic minimum spanning tree problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(3), pages 399-417, April.

    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:eee:csdana:v:49:y:2005:i:3:p:837-848. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/csda .

    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.