Compactification method in linear programming approach to infinite-horizon optimal control problems with a noncompact state constraint

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

This paper is devoted to a study of infinite horizon optimal control problems with time discounting and time averaging criteria in discrete time. It is known that these problems are related to certain in_nite-dimensional linear programming problems, but compactness of the state constraint is a common assumption imposed in analysis of these LP problems. In this paper, we con-sider an unbounded state constraint and use Alexandrofi compactification to carry out the analysis. We also establish asymptotic relationships between the optimal values of problems with time discounting and long-run average criteria.

Original languageEnglish (US)
Pages (from-to)110-123
Number of pages14
JournalDiscrete and Continuous Dynamical Systems - Series B
Volume29
Issue number1
DOIs
StatePublished - Jan 2024

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Compactification method in linear programming approach to infinite-horizon optimal control problems with a noncompact state constraint'. Together they form a unique fingerprint.

Cite this