Lp Formulations Of Discrete Time Long-Run Average Optimal Control Problems: The Nonergodic Case
SIAM JOURNAL ON CONTROL AND OPTIMIZATION(2019)
Abstract
We formulate and study the infinite dimensional linear programming (LP) problem associated with the deterministic discrete time long-run average criterion optimal control problem. Along with its dual, this LP problem allows one to characterize the optimal value of the optimal control problem. The novelty of our approach is that we focus on the general case wherein the optimal value may depend on the initial condition of the system.
MoreTranslated text
Key words
long-run average optimal control,linear programming,duality,infinite horizon and vanishing discount limits,sufficient/necessary optimality conditions
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined