Approximating probability density functions and their convolutions using orthogonal polynomials

DOI10.1016/0377-2217(95)00250-2zbMath0953.90500OpenAlexW2035377145MaRDI QIDQ1278378

Ralph D. Badinelli

Publication date: 22 February 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00250-2

zbMATH Keywords

inventoryapproximationproject management

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Inventory, storage, reservoirs (90B05)

Related Items

Life on the Move: Modeling the Effects of Climate-Driven Range Shifts with Integrodifference Equations ⋮ A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems ⋮ Management and takeover decisions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Determining the K Most Critical Paths in PERT Networks
• Bounding the Project Completion Time Distribution in PERT Networks
• A Multivariate Approach to Estimating the Completion Time for PERT Networks
• Approximating the Criticality Indices of the Activities in PERT Networks
• Simple General Approximations for a Random Variable and its Inverse Distribution Function Based on Linear Transformations of a Nonskewed Variate
• The Completion Time of PERT Networks
• A Model for Continuous-Review Pull Policies in Serial Inventory Systems
• A Numerical Algorithm for Recursively-Defined Convolution Integrals Involving Distribution Functions
• The Completion Time of PERT Networks