Inverse theorem in dynamic programming. I
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 3174053 (Why is no real title available?)
- scientific article; zbMATH DE number 3589284 (Why is no real title available?)
- Composition Principles for Synthesis of Optimal Multistage Processes
- FINITE HORIZON MARKOV GAMES WITH RECURSIVE PAYOFF SYSTEMS
- ON A NEW APPROACH TO THE NUMERICAL SOLUTION OF A CLASS OF PARTIAL DIFFERENTIAL INTEGRAL EQUATIONS OF TRANSPORT THEORY
- Point-to-Set Maps in Mathematical Programming
- Scheduling to Minimize Interaction Cost
Cited in
(18)- Input optimization for infinite-horizon discounted programs
- A generalization of the Hölder inequality through dynamic programming approach
- The principle and models of dynamic programming
- The principle and models of dynamic programming. II
- The principle and models of dynamic programming. III
- Continuous dynamic programming approach to inequalities
- Some operations on dynamic programmings with one-dimensional state space
- Functional equation approach to inequalities
- Inverse theorem in dynamic programming. II
- Inverse theorem in dynamic programming. III
- Functional equation approach to inequalities. II
- A new inversion of continuous-time optimal control processes
- Dynamic programming approach to inequalities
- Dynamic programming and inequalities
- Some theorems on reverse inequalities
- Reverse function, reverse program, and reverse theorem in mathematical programming
- The principle and models of dynamic programming. IV
- Inversion of dynamic programs and its applications to allocation processes
This page was built for publication: Inverse theorem in dynamic programming. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1145359)
