Optimal procedures for dynamic programs with complex loop structures
type: Item
instance of: scholarly article
title: Optimal procedures for dynamic programs with complex loop structures
zbMATH Open document ID: 0616.90092
DOI: 10.1016/0022-247X(86)90159-9
author: Chae Y. Lee
author: Augustine O. Esogbue
published in: Journal of Mathematical Analysis and Applications
publication date: 1986-01-01T00:00:00Z
review text: This paper presents an optimization procedure and the associated complexity analyses for nonserial dynamic programs involving various types of loop structures. Although in general the optimization of single loop systems requires two-dimensional memory space, we prove that under the assumption of linear transition and return functions, the processing of the main serial chain can be reduced to a one-dimensional optimization problem. For more complex structures, we consider dependent and independent multi-loop systems. Although dependent systems create a rapid increase in the complexity of algorithms, we accomplish a dramatic reduction in dimensionality by investigating the optimal absorption stage for the combined loop return. For interactive loops we introduce a node partitioning type algorithm.
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 3999702
zbMATH Keywords: nonserial dynamic programs
zbMATH Keywords: loop structures
zbMATH Keywords: multi-loop systems
zbMATH Keywords: optimal absorption stage
MaRDI profile type: Publication
cites work: Superposition in branching allocation problems
cites work: Q3292915
cites work: A new algorithm for the solution of the secondary optimization problem in non-serial dynamic programming
cites work: Contribution to nonserial dynamic programming
cites work: A theorem in nonserial dynamic programming
cites work: Non-Serial Dynamic Programming — A Survey
cites work: Dynamic Programming Models of the Nonserial Critical Path-Cost Problem
cites work: Fuzzy dynamic programming, fuzzy adaptive neuro control, and the general medical diagnosis problem
cites work: Q4198056
cites work: Closed form solutions to nonserial, nonconvex quadratic programming problems using dynamic programming
cites work: A Dynamic Programming Solution to Cost-Time Tradeoff for CPM
description: scientific article; zbMATH DE number 3999702