Stochastic Bounds on Distributions of Optimal Value Functions with Applications to Pert, Network Flows and Reliability,

Abstract

Meilijson and Nadas (1979) have obtained stochastic bounds in the convex majorisation sense to the critical path length of a project network with random activity durations. This paper presents those results in a more general framework and, using similar techniques, obtain bounds for shortest route, maximal flow and reliability system lifetime. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1985
Accession Number
ADA170778

Entities

People

  • Gideon Weiss

Organizations

  • Georgia Tech

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Classification
  • Computer Programming
  • Decomposition
  • Discontinuities
  • Distribution Functions
  • Engineering
  • Information Science
  • Linear Programming
  • Mathematical Programming
  • Optimization
  • Probability
  • Random Variables
  • Security
  • Simplex Method
  • Systems Engineering
  • Terminals
  • Universities

Readers

  • Operations Research
  • Statistical inference.