𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A mechanical dynamic programming algorithm for structure optimization

✍ Scribed by Eckart Schnack; Uwe Spörl

Publisher
John Wiley and Sons
Year
1986
Tongue
English
Weight
992 KB
Volume
23
Category
Article
ISSN
0029-5981

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dynamic programming algorithm for optimi
Dynamic programming algorithm for optimizing distributed parameter trajectories with constraints
✍ K.Y.K. Ng; N.G.F. Sancho 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 533 KB

This paper develops an iterative algorithm for solving dynamic programming problems with state and control inequality constraints. The advantage of the algorithm is that it reduces the dimensionality difficulties. The technique is then employed to evaluate the optimum state and control responses of

A Reach and Bound algorithm for acyclic
A Reach and Bound algorithm for acyclic dynamic-programming networks
✍ Matthew D. Bailey; Robert L. Smith; Jeffrey M. Alden 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB

## Abstract Node pruning is a commonly used technique for solution acceleration in a dynamic‐programming network. In pruning, nodes are adaptively removed from the dynamic programming network when they are determined not to lie on an optimal path. We introduce an ε‐pruning condition that extends pr