National Technical Reports Library

The National Technical Information Service acquires, indexes, abstracts, and archives the largest collection of U.S. government-sponsored technical reports in existence. The NTRL offers online, free and open access to these authenticated government technical reports. Technical reports and documents in its repository may be available online for free either from the issuing federal agency, the U.S. Government Publishing Office’s Federal Digital System website, or through search engines.

Details

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

AD711811

Publication Date	1970
Personal Author	Pipes, L. J.
Page Count	26
Abstract	The report presents derivation, documentation, and listing of a dynamic programming model on JOSS FOR FINDING OPTIMAL SOLUTIONS (minimum-cost paths) to network problems. The network represents the possible connections between decisions and expresses costs of going from one to another. The model encompasses a value-iterative algorithm which successively converges to the solution. The principle of optimality, which permits finding the minimum-cost (shortest) path as a function of the maximum number of arcs allowed, is: Regardless of how a particular state was arrived at, the remaining decisions as to what path to take enroute to the terminal must themselves constitute an optimal solution. The costs of traversing arcs may be input, recalled from other files, or calculated by JOSS from input functions. Model flexibility allows for testing the sensitivity of a decision process to changes in the terminal point. (Author)
Keywords	Dynamic programming Networks Problem solving Programming languages Data processing systems Costs Simulation Combinatorial analysis Time sharing Optimization Mathematical models Algorithms Decision making Mathematical programming
NTIS Subject Category	62B - Computer Software
Corporate Authors	Rand Corp Santa Monica Calif
Document Type	Technical Report
NTIS Issue Number	197022
Contract Number	DAHC15-67-C-0142

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

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

Publication Date	1970
Personal Author	Pipes, L. J.
Page Count	26
Abstract	The report presents derivation, documentation, and listing of a dynamic programming model on JOSS FOR FINDING OPTIMAL SOLUTIONS (minimum-cost paths) to network problems. The network represents the possible connections between decisions and expresses costs of going from one to another. The model encompasses a value-iterative algorithm which successively converges to the solution. The principle of optimality, which permits finding the minimum-cost (shortest) path as a function of the maximum number of arcs allowed, is: Regardless of how a particular state was arrived at, the remaining decisions as to what path to take enroute to the terminal must themselves constitute an optimal solution. The costs of traversing arcs may be input, recalled from other files, or calculated by JOSS from input functions. Model flexibility allows for testing the sensitivity of a decision process to changes in the terminal point. (Author)
Keywords	Dynamic programming Networks Problem solving Programming languages Data processing systems Costs Simulation Combinatorial analysis Time sharing Optimization Mathematical models Algorithms Decision making Mathematical programming
NTIS Subject Category	62B - Computer Software
Corporate Authors	Rand Corp Santa Monica Calif
Document Type	Technical Report
NTIS Issue Number	197022
Contract Number	DAHC15-67-C-0142