Using mathematical programming to solve factored Markov decision processes with imprecise probabilities
type: Item
instance of: scholarly article
title: Using mathematical programming to solve factored Markov decision processes with imprecise probabilities
zbMATH Open document ID: 1229.90255
author: Karina Valdivia Delgado
author: Leliane Nunes de Barros
author: Fabio Gagliardi Cozman
author: Scott Sanner
published in: International Journal of Approximate Reasoning
publication date: 2011-11-22T00:00:00Z
Mathematics Subject Classification ID: 90C40
zbMATH DE Number: 5976294
zbMATH Keywords: imprecise Markov decision processes (MDPIPs)
zbMATH Keywords: probabilistic planning
zbMATH Keywords: multilinear programming
Wikidata QID: Q62047364
describes a project that uses: MINOS
MaRDI profile type: Publication
full work available at URL: j.ijar.2011.04.002
OpenAlex ID: W2152240460
cites work: Optimal control of diffusion processes with reflection
cites work: Q4256521
cites work: Q5713453
cites work: Q3241581
cites work: Markovian Decision Processes with Uncertain Transition Probabilities
cites work: Markov Decision Processes with Imprecise Transition Probabilities
cites work: Graphical models for imprecise probabilities
cites work: Q4434179
cites work: An Analysis of Stochastic Shortest Path Problems
cites work: Q3266141
cites work: Linear programming and sequential decisions
cites work: The Complexity of Markov Decision Processes
cites work: Generalized polynomial approximations in Markovian decision processes
cites work: Statistical decision theory and Bayesian analysis. 2nd ed
cites work: Q3999364
cites work: Robust Control of Markov Decision Processes with Uncertain Transition Matrices
cites work: Q5800557
cites work: Bounded-parameter Markov decision processes
cites work: Credal networks
cites work: Convex two-level optimization
cites work: A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience
cites work: An inexact-restoration method for nonlinear bilevel programming problems
cites work: The steepest descent direction for the nonlinear bilevel programming problem
cites work: Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
cites work: A tutorial on geometric programming
cites work: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
cites work: Problems in multilinear programming.
cites work: On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
cites work: Symmetric approximate linear programming for factored MDPs with application to constrained problems
cites work: Discrete time Markov chains with interval probabilities
DBLP publication ID: journals/ijar/DelgadoBCS11
DOI: 10.1016/J.IJAR.2011.04.002
Recommended article: Efficient solutions to factored MDPs with imprecise transition probabilities
Recommended article: A mathematical programming approach to a problem in variance penalised Markov decision processes
Recommended article: Generalizing Markov decision processes to imprecise probabilities
Recommended article: Markov Decision Processes with Imprecise Transition Probabilities
Recommended article: Real-time dynamic programming for Markov decision processes with imprecise probabilities
Recommended article: Q3778568
Recommended article: Q3819913
Recommended article: Solution Procedures for Partially Observed Markov Decision Processes
Recommended article: Partially observable Markov decision processes with imprecise parameters
Recommended article: Markov decision programming with constraints
description: scientific article; zbMATH DE number 5976294