STRONG REPRESENTATION OF A DISCRETE DECISION PROCESS BY POSITIVELY/NEGATIVELY BITONE SEQUENTIAL DECISION PROCESS

DOI10.1142/S0217595907001218zbMath1122.90049MaRDI QIDQ3439886

Yukihiro Maruyama

Publication date: 21 May 2007

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

dynamic programmingstrong representationfinite automatonbitone sequential decision processdiscrete decision process

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Dynamic programming (90C39)

Cites Work

• From dynamic programming to bynamic programming
• Strong representation theorems for bitone sequential decision processes
• Finite-State Processes and Dynamic Programming
• Representation theorems for equivalent optimization problems

This page was built for publication: STRONG REPRESENTATION OF A DISCRETE DECISION PROCESS BY POSITIVELY/NEGATIVELY BITONE SEQUENTIAL DECISION PROCESS