Bounding procedures for multistage stochastic dynamic networks

Linos F. Frantzeskakis, Warren Buckler Powell

Research output: Contribution to journalArticle

1 Scopus citations

Abstract

This paper presents new procedures for obtaining upper and lower bounds in the cost minimization of multistage dynamic networks with random link capacities and contrasts them to existing methods. These methods include adaptation of Jensen's inequality to the problem, Monte‐Carlo simulations and an analytical approximation procedure. The new bounding procedures involve a backward pass in the network coupled with a linear approximation at each stage. Some numerical results are presented for networks of substantial size. © 1993 by John Wiley & Sons, Inc.

Original languageEnglish (US)
Pages (from-to)575-595
Number of pages21
JournalNetworks
Volume23
Issue number7
DOIs
StatePublished - Oct 1993

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Bounding procedures for multistage stochastic dynamic networks'. Together they form a unique fingerprint.

  • Cite this