From dynamic programming to bynamic programming
The author suggests a new sequential optimization method called `bynamic programming', which includes dynamic programming as a special case. The objective function \(g(x,.)\) defined on \(X\times R^{\ell}\) is separable and at the same time nonincreasing or nondecreasing in the second variable for \(x\in X^ -\), \(x\in X^ +\) respectively, where \(X\) is the disjoint union of \(X^ +\) and \(X^ -\), the so called bitonicity property. A theoretical background of bynamic programming is given. Multiplicative programming and multiplicatively additive programming are presented as special cases of bynamic programming. Infinite horizon bynamic programming is studied in the concluding part of the paper.
- scientific article; zbMATH DE number 53073
- scientific article; zbMATH DE number 5866260
- scientific article; zbMATH DE number 1260458
- scientific article; zbMATH DE number 1431652
- Dynamic programming
- scientific article; zbMATH DE number 5152598
- scientific article; zbMATH DE number 49715
- scientific article; zbMATH DE number 3871062
- The complexity of dynamic programming
- Dynamic programming and pseudo-inverses
- Sequential minimaxization under dynamic programming structure
- Two dynamic programming algorithms for which interpreted pebbling helps
- Shortest and longest path problems
- STRONG REPRESENTATION OF A DISCRETE DECISION PROCESS BY POSITIVELY/NEGATIVELY BITONE SEQUENTIAL DECISION PROCESS
- scientific article; zbMATH DE number 617942 (Why is no real title available?)
- On a negative-equivalency theorem in associative optimal path problems
- On Markov policies for minimax decision processes
- Beating a Benchmark: Dynamic Programming May Not Be the Right Numerical Approach
This page was built for publication: From dynamic programming to bynamic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1260896)
