# Accession Number:

## ADA028398

# Title:

## An Analysis and Optimization Technique for Probabilistic Graphs,

# Descriptive Note:

# Corporate Author:

## AIR FORCE INST OF TECH WRIGHT-PATTERSON AFB OHIO SCHOOL OF ENGINEERING

# Personal Author(s):

# Report Date:

## 1976-08-01

# Pagination or Media Count:

## 177.0

# Abstract:

A communication network serving multiple user pairs is modeled as a probabilistic graph. The problem of finding optimum constrained strategies for either attacking or designing the network is considered. An objective function which can be interpreted as the expected value of the network is developed. New network analysis algorithms which create the objective function for arbitrary networks are presented. The objective function is nonseparable and, in general, neither concave nor convex consequently conventional optimization techniques fail. An algorithm which enumerates a subset of the feasible strategies, and evaluates a subset of these, to find the optimum is presented. Two heuristics are given as well. All the algorithms herein have been programmed in Fortran IV. Computational results and execution times for a number of examples are given. Comparisons with results in the literature are given where possible. Author

# Descriptors:

# Subject Categories:

- Statistics and Probability
- Command, Control and Communications Systems