Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | https://arxiv.org/abs/2503.12238 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916687177056256 |
|---|---|
| author | Varagapriya, V |
| author_facet | Varagapriya, V |
| contents | We examine a constrained Markov decision process under uncertain transition probabilities, with the uncertainty modeled as deviations from observed transition probabilities. We construct the uncertainty set associated with the deviations using polyhedral and second-order cone constraints and employ a robust optimization framework. We demonstrate that each inner optimization problem of the robust model can be equivalently transformed into a second-order cone programming problem. Using strong duality arguments, we show that the resulting robust problem can be equivalently reformulated into a second-order cone programming problem with bilinear constraints. In the numerical experiments, we study a machine replacement problem and explore potential sources of uncertainty in the transition probabilities. We examine how the optimal values and solutions differ as we vary the feasible region of the uncertainty set, considering only polyhedral constraints and a combination of polyhedral and second-order cone constraints. Furthermore, we analyze the impact of the number of states, the discount factor, and variations in the feasible region of the uncertainty set on the optimal values. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_12238 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Transition Uncertainties in Constrained Markov Decision Models: A Robust Optimization Approach Varagapriya, V Optimization and Control We examine a constrained Markov decision process under uncertain transition probabilities, with the uncertainty modeled as deviations from observed transition probabilities. We construct the uncertainty set associated with the deviations using polyhedral and second-order cone constraints and employ a robust optimization framework. We demonstrate that each inner optimization problem of the robust model can be equivalently transformed into a second-order cone programming problem. Using strong duality arguments, we show that the resulting robust problem can be equivalently reformulated into a second-order cone programming problem with bilinear constraints. In the numerical experiments, we study a machine replacement problem and explore potential sources of uncertainty in the transition probabilities. We examine how the optimal values and solutions differ as we vary the feasible region of the uncertainty set, considering only polyhedral constraints and a combination of polyhedral and second-order cone constraints. Furthermore, we analyze the impact of the number of states, the discount factor, and variations in the feasible region of the uncertainty set on the optimal values. |
| title | Transition Uncertainties in Constrained Markov Decision Models: A Robust Optimization Approach |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2503.12238 |