Subroutines for computing normal probabilities of sets -- computer experiences
From MaRDI portal
Publication:5933852
DOI10.1023/A:1019215116991zbMath1058.90039OpenAlexW199141222MaRDI QIDQ5933852
Publication date: 14 June 2001
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1019215116991
Related Items (15)
Second-order differentiability of probability functions ⋮ Solving joint chance constrained problems using regularization and Benders' decomposition ⋮ An integer programming approach for linear programs with probabilistic constraints ⋮ On the quantification of nomination feasibility in stationary gas networks with random load ⋮ Solving Chance-Constrained Problems via a Smooth Sample-Based Nonlinear Approximation ⋮ Optimal Neumann Boundary Control of a Vibrating String with Uncertain Initial Data and Probabilistic Terminal Constraints ⋮ Generalized gradients for probabilistic/robust (probust) constraints ⋮ Consequences of Uncertain Friction for the Transport of Natural Gas through Passive Networks of Pipelines ⋮ Subdifferential characterization of probability functions under Gaussian distribution ⋮ Cell-and-bound algorithm for chance constrained programs with discrete distributions ⋮ Efficiency of Monte Carlo computations in very high dimensional spaces ⋮ Two-stage stochastic problems with correlated normal variables: computational experiences ⋮ A joint model of probabilistic/robust constraints for gas transport management in stationary networks ⋮ On probabilistic capacity maximization in a stationary gas network ⋮ (Sub-)Gradient Formulae for Probability Functions of Random Inequality Systems under Gaussian Distribution
This page was built for publication: Subroutines for computing normal probabilities of sets -- computer experiences
