Bounds for the expectation of linear combinations of order statistics with application to pert networks

DOI10.1080/07362998608809096zbMath0648.62021OpenAlexW1987675474MaRDI QIDQ3793510

Claude Lefèvre

Publication date: 1986

Published in: Stochastic Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/07362998608809096

zbMATH Keywords

upper boundsexpectation of linear combinations of order statisticsmean completion time in PERT networks

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Order statistics; empirical distribution functions (62G30) Statistical distribution theory (62E99)

Related Items (7)

Sharp bounds for \(L\)-statistics from dependent samples of random length ⋮ General bounds and inequalities in order statistics ⋮ Bounds forL-Statistics from Weakly Dependent Samples of Random Length ⋮ On reduced semidefinite programs for second order moment bounds with applications ⋮ Expectation bounds on linear estimators from dependent samples ⋮ Maximizing the expected range from dependent observations under mean–variance information ⋮ Moments ofL-Statistics: A Divided Differences Approach

Cites Work

• An upper bound on the expected completion time of PERT networks
• Bounds on expectations of linear systematic statistics based on dependent samples
• Upper (lower) bounds on the mean of the maximum (minimum) of a number of random variables

This page was built for publication: Bounds for the expectation of linear combinations of order statistics with application to pert networks