Dynamic programming method for deterministic discrete processes of general form

DOI10.1007/BF00968520MaRDI QIDQ1260600zbMATH OpenFDO

Authors P. P. Rupsys

Publication date 1978

Published in Lithuanian Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

dynamic programmingdifference equationsmultivalued mappingdiscrete processes

Mathematics Subject Classification ID

Methods involving semicontinuity and convergence; relaxation (49J45) Dynamic programming in optimal control and differential games (49L20) Discrete-time control/observation systems (93C55)

Cites work

• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 3144124 (Why is no real title available?)
• scientific article; zbMATH DE number 3535201 (Why is no real title available?)
• scientific article; zbMATH DE number 3394931 (Why is no real title available?)
• Conditions for optimality in dynamic programming and for the limit of n-stage optimal policies to be optimal

This page was built for publication: Dynamic programming method for deterministic discrete processes of general form

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1260600)