# Accession Number:

## AD0618750

# Title:

## SENSITIVITY ANALYSIS OF NETWORKS

# Descriptive Note:

# Corporate Author:

## CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER

# Personal Author(s):

# Report Date:

## 1965-04-01

# Pagination or Media Count:

## 62.0

# Abstract:

A maximum flow network is defined by a set of arcs and a set of points called nodes. Each arc joins two nodes and has associated with it a positive capacity which represents the maximum amount of flow that may pass over it. One of the nodes is designated as the source and another as the sink. From these nodes, arc, and capacities the maximum amount of flow that may pass from source to sink may be calculated. This investigation is concerned with a sensitivity analysis on such networks. Specifically, each arc of the network is assumed to be subject to breakdowns which result in a reduction in its capacity. The problem is to find the greatest reduction in maximum flow possible if n breakdowns occur and to find where these breakdowns must occur for this reduction to result. The methods developed in this report solve this problem for a certain class of networks known as planar networks.

# Descriptors:

# Subject Categories:

- Numerical Mathematics