An application of Lemke's method to a class of Markov decision problems

An application of Lemke's method to a class of Markov decision problems

0.00 Avg rating0 Votes
Article ID: iaor20002423
Country: Netherlands
Volume: 116
Issue: 3
Start Page Number: 584
End Page Number: 590
Publication Date: Aug 1999
Journal: European Journal of Operational Research
Authors: ,
Keywords: programming: mathematical
Abstract:

This paper presents an application of Lemke's method to a class of Markov decision problems, appearing in the optimal stopping problems, and other well-known optimization problems. We consider a special case of Markov decision problems with finitely many states, where the agent can choose one of the alternatives; getting a fixed reward immediately or paying the penalty for one term. We show that the problem can be reduced to a linear complementarity problem that can be solved by Lemke's method with the number of iterations less than the number of states. The reduced linear complementarity problem does not necessarily satisfy the copositive-plus condition. Nevertheless we show that the Lemke's method succeeds in solving the problem by proving that the problem satisfies a necessary and sufficient condition for the extended Lemke's method to compute a solution in the piecewise linear complementarity problem.

Reviews

Required fields are marked *. Your email address will not be published.