𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A dynamic programming algorithm for multiple-choice constraints

✍ Scribed by Mary W. Cooper; Keyvan Farhangian

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
315 KB
Volume
10
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

✦ Synopsis

This

report concerns a discrete mathematical programming problem in which the variables are binary or integer, the objective function separable or factorable, and the constraints are in either of two classes: linear or multiple-choice constraints. The problem is solved using a dynamic programming approach with fathoming by bounds and by infeasibility.

πŸ“œ 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