|Title:||A Discrete Dynamic Programming Problem With Multidimensional Step Selection
|Authors:||Elemer E. Rosinger
|Abstract:||A scalar minimization problem of selecting finite sequences of steps, each ~tep a point in Rn , subjected to order constraints" Is presented. It Is proved that the minimal step sequences and minimal cost satisfy R. Bellman's recurrence relations. The problem arose connected with the design of the optimal numbe~ of types and optimal types of poles used In power lines.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1976/CS/CS0090), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1976
To the main CS technical reports page
Computer science department, Technion