On computing the distribution function of the sum of independent random variables

DOI10.1016/S0305-0548(99)00133-1zbMath0973.65005MaRDI QIDQ5932342

Mani K. Agrawal, Salah E. Elmaghraby

Publication date: 10 December 2001

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

Chebychev pointsconvolution of random variablesdiscrete approximationdistribution functionlarge activity networkssum of independent random variables

Mathematics Subject Classification ID

Probability distributions: general theory (60E05)

Related Items (4)

The multifacility center problems with random demand weights ⋮ Adjustment of the moments of the project completion times when activity times are exponentially distributed ⋮ A new approach to determine the critical path in stochastic activity network ⋮ A new approximation algorithm for obtaining the probability distribution function for project completion time

Uses Software

• FITPACK

Cites Work

• A practical guide to splines
• Distribution of the Time Through a Directed, Acyclic Network
• Unnamed Item
• Unnamed Item

This page was built for publication: On computing the distribution function of the sum of independent random variables