Abstract
In various network models the quantities of interest are optimal value functions of the form max ΣX i , min ΣX i , min maxX i , max minX i , where the inner operation is on the nodes of a path/cut and the outer operation on all paths/cuts, e.g. shortest path of a project network, maximal flow of a flow network or lifetime of a reliability system. ForX i random with given marginal distributions, we obtain bounds for the optimal value functions, based on common and on antithetic joint distributions.
Similar content being viewed by others
References
R.E. Barlow and F. Proschan,Statistical Theory of Reliability and Life Testing: Probability Models (Holt Rinehart Winston, New York, 1975).
S. E. Elmaghraby,Activity Networks, Project Planning and Control by Network Models (Wiley, New York, 1977).
J. D. Esary and F. Proschan, A reliability bound for systems of maintained, interdependent components, J. Amer. Statist. Assoc. 65 (1970) 329.
L. R. Ford and D. R. Fulkerson,Flows in Networks (Princeton Univ. Press, Princeton, 1962).
D. R. Fulkerson, A network flow computation for project cost curves, Manag. Science 7 (1961) 167.
D. R. Fulkerson, Blocking and anti-blocking pairs of polyhedra, Math. Progr. 1 (1971) 168.
J. M. Hammersley and J. G. Mauldon, General principles of antithetic variables, Proc. Camb. Phil. Soc. 52 (1956) 476.
D. C. Handscomb, Proof of the antithetic variate theorem forn>2, Proc. Camb. Phil. Soc. 54 (1958) 300.
U. Heller, On the shortest overall duration in stochastic project networks, Technical Report (1980).
W. K. Klein Hanefeld, Distributions with known marginals and duality of mathematical programming with application to PERT, Technical Report 90 (OR-8203) (Rijksuniversiteit, Groningen, 1982).
L. E. Lawler,Combinatorial Optimization: Networks and Matroids (Holt Rhinehart Winston, New York, 1976).
I. Meilijson and A. Nadas, Convex majorization with an application to the length of critical paths, J. Appl. Prob. 16 (1979) 671.
R. H. Mohring and F. J. Radermacher, Substitution decomposition for discrete structures and connections with combinatorial optimization, Ann. Discr. Math.
A. Nadas, Probabilistic PERT, IBM J. Res. Develop. 23 (1979) 339.
B. Natvig, Improved bounds for the availability and unavailability in a fixed time interval for systems of maintained, interdependent components, Adv. Appl. Prob. 12 (1980) 200.
P. Robillard and M. Trahan, The completion time of PERT networks, Oper. Res. 25 (1977) 15.
A. W. Shogan, Bounding distributions for a stochastic PERT network, Networks 7 (1977) 359.
H. G. Spelde, Stochastische Netzplane und ihre Anwendung im Baubetrieb, Dissertation (RWTH Aachen, 1976).
D. Stoyan, Qualitative Eigenschaften und Abschatzungen Stochastischer Modelle (Oldenburg, München, 1977).
G. Weiss, Stochastic bounds on distributions of optimal value functions with applications to PERT, Network Flow and Reliability. Schriften Informatik Angew. Geb. 81 (RWTH Aachen, West Germany, 1982).
W. Whitt, Bivariate distributions with given marginals. Ann. Statist. 4 (1976) 1280.
E. Zemel, Polynomial algorithms for network reliability, Networks 12 (1982) 439.
Author information
Authors and Affiliations
Additional information
This work was carried out during a visit to RWTH Aachen, supported by DAAD.
Rights and permissions
About this article
Cite this article
Weiss, G. Stochastic bounds on distributions of optimal value functions with applications to pert, network flows and reliability. Ann Oper Res 1, 59–65 (1984). https://doi.org/10.1007/BF01874452
Issue Date:
DOI: https://doi.org/10.1007/BF01874452