IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v198y2009i3p848-858.html
   My bibliography  Save this article

Asymptotic formulas for the derivatives of probability functions and their Monte Carlo estimations

Author

Listed:
  • Garnier, Josselin
  • Omrane, Abdennebi
  • Rouchdy, Youssef

Abstract

One of the key problems in chance constrained programming for nonlinear optimization problems is the evaluation of derivatives of joint probability functions of the form . Here is the vector of physical parameters, is a random vector describing the uncertainty of the model, is the constraints mapping, and is the vector of constraint levels. In this paper specific Monte Carlo tools for the estimations of the gradient and Hessian of P(x) are proposed when the input random vector [Lambda] has a multivariate normal distribution and small variances. Using the small variance hypothesis, approximate expressions for the first- and second-order derivatives are obtained, whose Monte Carlo estimations have low computational costs. The number of calls of the constraints mapping g for the proposed estimators of the gradient and Hessian of P(x) is only 1+2Nx+2N[Lambda]. These tools are implemented in penalized optimization routines adapted to stochastic optimization, and are shown to reduce the computational cost of chance constrained programming substantially.

Suggested Citation

  • Garnier, Josselin & Omrane, Abdennebi & Rouchdy, Youssef, 2009. "Asymptotic formulas for the derivatives of probability functions and their Monte Carlo estimations," European Journal of Operational Research, Elsevier, vol. 198(3), pages 848-858, November.
    • Handle: RePEc:eee:ejores:v:198:y:2009:i:3:p:848-858
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(08)00799-6
    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. Mark J. Schervish, 1984. "Multivariate Normal Probabilities with Error Bound," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 33(1), pages 81-94, March.
    2. Suvrajeet Sen & Julia L. Higle, 1999. "An Introductory Tutorial on Stochastic Linear Programming Models," Interfaces, INFORMS, vol. 29(2), pages 33-61, April.
    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. René Henrion & Andris Möller, 2012. "A Gradient Formula for Linear Chance Constraints Under Gaussian Distribution," Mathematics of Operations Research, INFORMS, vol. 37(3), pages 475-488, August.
    2. Wim Ackooij & Pedro Pérez-Aros, 2020. "Gradient Formulae for Nonlinear Probabilistic Constraints with Non-convex Quadratic Forms," Journal of Optimization Theory and Applications, Springer, vol. 185(1), pages 239-269, April.

    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. Sarhadi, Hassan & Naoum-Sawaya, Joe & Verma, Manish, 2020. "A robust optimization approach to locating and stockpiling marine oil-spill response facilities," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    2. Gregory A. Godfrey & Warren B. Powell, 2001. "An Adaptive, Distribution-Free Algorithm for the Newsvendor Problem with Censored Demands, with Applications to Inventory and Distribution," Management Science, INFORMS, vol. 47(8), pages 1101-1112, August.
    3. Stephan Nagl & Michaela Fürsch & Dietmar Lindenberger, 2013. "The Costs of Electricity Systems with a High Share of Fluctuating Renewables: A Stochastic Investment and Dispatch Optimization Model for Europe," The Energy Journal, , vol. 34(4), pages 151-180, October.
    4. Martinetti, Davide & Geniaux, Ghislain, 2017. "Approximate likelihood estimation of spatial probit models," Regional Science and Urban Economics, Elsevier, vol. 64(C), pages 30-45.
    5. József Bukszár & András Prékopa, 2001. "Probability Bounds with Cherry Trees," Mathematics of Operations Research, INFORMS, vol. 26(1), pages 174-192, February.
    6. Wai-Sum Chan, 1999. "Exact joint forecast regions for vector autoregressive models," Journal of Applied Statistics, Taylor & Francis Journals, vol. 26(1), pages 35-44.
    7. Rao, Harish Venkatesh & Dutta, Goutam & Basu, Sankarshan, 2014. "Database Structure for a Multi Stage Stochastic Optimization Based Decision Support System for Asset – Liability Management of a Life Insurance Company," IIMA Working Papers WP2014-06-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
    8. W. Kuiper & Anton Cozijnsen, 2011. "The Performance of German Firms in the Business-Related Service Sectors Revisited: Differential Evolution Markov Chain Estimation of the Multinomial Probit Model," Computational Economics, Springer;Society for Computational Economics, vol. 37(4), pages 331-362, April.
    9. Lee, Jae Won & Sather, Harland N., 1998. "A supremum version of logrank test for detecting late occurring survival differences," Computational Statistics & Data Analysis, Elsevier, vol. 26(3), pages 303-311, January.
    10. Lee, Jae Won & DeMets, David L., 1999. "Estimation following group sequential tests with repeated measurements data," Computational Statistics & Data Analysis, Elsevier, vol. 32(1), pages 69-77, November.
    11. Satish Ukkusuri & S. Waller, 2008. "Linear Programming Models for the User and System Optimal Dynamic Network Design Problem: Formulations, Comparisons and Extensions," Networks and Spatial Economics, Springer, vol. 8(4), pages 383-406, December.
    12. Phinikettos, Ioannis & Gandy, Axel, 2011. "Fast computation of high-dimensional multivariate normal probabilities," Computational Statistics & Data Analysis, Elsevier, vol. 55(4), pages 1521-1529, April.
    13. Khan, Asif & Asad, Mohammad Waqar Ali, 2019. "A method for optimal cut-off grade policy in open pit mining operations under uncertain supply," Resources Policy, Elsevier, vol. 60(C), pages 178-184.
    14. Alexandra M. Newman & Martin Weiss, 2013. "A Survey of Linear and Mixed-Integer Optimization Tutorials," INFORMS Transactions on Education, INFORMS, vol. 14(1), pages 26-38, September.
    15. Amy David & David Farr & Ross Januszyk & Urmila Diwekar, 2015. "USG Uses Stochastic Optimization to Lower Distribution Costs," Interfaces, INFORMS, vol. 45(3), pages 216-227, June.
    16. Seog-Chan Oh & Alfred J. Hildreth, 2013. "Decisions on Energy Demand Response Option Contracts in Smart Grids Based on Activity-Based Costing and Stochastic Programming," Energies, MDPI, vol. 6(1), pages 1-19, January.
    17. Per A. Brodtkorb, 2006. "Evaluating Nearly Singular Multinormal Expectations with Application to Wave Distributions," Methodology and Computing in Applied Probability, Springer, vol. 8(1), pages 65-91, March.
    18. de Oliveira, Francisco Alexandre & de Paiva, Anderson Paulo & Lima, José Wanderley Marangon & Balestrassi, Pedro Paulo & Mendes, Ronã Rinston Amaury, 2011. "Portfolio optimization using Mixture Design of Experiments: Scheduling trades within electricity markets," Energy Economics, Elsevier, vol. 33(1), pages 24-32, January.
    19. A. Hayter & Y. Lin, 2012. "The evaluation of two-sided orthant probabilities for a quadrivariate normal distribution," Computational Statistics, Springer, vol. 27(3), pages 459-471, September.
    20. David Rosenberg & Jay Lund, 2009. "Modeling Integrated Decisions for a Municipal Water System with Recourse and Uncertainties: Amman, Jordan," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 23(1), pages 85-115, January.

    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:ejores:v:198:y:2009:i:3:p:848-858. 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/eor .

    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.