Linear programming with multiple choice constraints for single chain undiscounted Markov decision problems

DOI10.1016/0167-6377(85)90006-9zbMath0569.90093OpenAlexW1969898762MaRDI QIDQ1060967

Norihiro Mizuno

Publication date: 1985

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(85)90006-9

zbMATH Keywords

simplex methodfinite statemultiple choice constraintssingle chain undiscounted Markov decision problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Markov and semi-Markov decision processes (90C40)

Cites Work

• On the block upper-triangularity of undiscounted multi-chain Markov decision problems
• Linear Programming and Sequential Decisions
• On Linear Programming in a Markov Decision Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Linear programming with multiple choice constraints for single chain undiscounted Markov decision problems