Title

A Dynamic Programming Approach to Network Problems: A Model for On-Line Computer Systems

Description

This Memorandum contains the derivation of a dynamic-programming model for finding optimal solutions to problems involving certain multi-stage decision processes. The model has been implemented on JOSS, and instructions on its use are also included.

The dynamic-programming approach analyzes an optimization problem with various constraints and variables by decomposing the problem into a sequence of stages at which lower-order optimization takes place. The model presented here encompasses a value-iterative method which is less restrictive and which offers desirable advantages over other currently used techniques One such advantage is a reduction in the actual amount of computer storage required to reach an optimal solution.

The model is flexible and allows for testing the sensitivity of a decision process to changes in the terminal point and thus in the associated costs. Additional information may be gained from examining the buildup of an optimal solution, which can also be printed out if conditions permit.

Subject

Dynamic Programming

Mathematical Models

Algorithms

Data Processing

Simulation

Optimization

Decision Making

Networks

Programming Languages

Problem Solving

Mathematical Programming

Costs

Combinatorial Analysis

Time Sharing

Abstract

This Memorandum contains the derivation of a dynamic-programming model for finding optimal solutions to problems involving certain multi-stage decision processes. The model has been implemented on JOSS, and instructions on its use are also included.

The dynamic-programming approach analyzes an optimization problem with various constraints and variables by decomposing the problem into a sequence of stages at which lower-order optimization takes place. The model presented here encompasses a value-iterative method which is less restrictive and which offers desirable advantages over other currently used techniques One such advantage is a reduction in the actual amount of computer storage required to reach an optimal solution.

The model is flexible and allows for testing the sensitivity of a decision process to changes in the terminal point and thus in the associated costs. Additional information may be gained from examining the buildup of an optimal solution, which can also be printed out if conditions permit.

Creator

Pipes, L. J.

Publisher

Santa Monica, CA : The RAND Corporation

Date

1970

Format

ix, 19 pages : ill. ; 28 cm.

Type

report

Identifier

AD0711811

AD0711811

Date Issued

1970-08

Corporate Author

The RAND Coporation

Report Number

RM-6338-ARPA

Contract

DAHC15 67 C 0142

NTRL Accession Number

AD711811

Distribution Conflict

No

Access Rights

THIS DOCUMENT HAS BEEN APPROVED FOR PUBLIC RELEASE AND SALE; ITS DISTRIBUTION IS UNLIMITED

Index Abstract

Contrails and DTIC condensed

Photo Quality

Not Needed

Distribution Classification

1

DTIC Record Exists

Yes

Report Availability

Full text available by request