Skip to main content
Log in

Stopped Markov decision processes with multiple constraints

  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

Abstract

In this paper, a optimization problem for stopped Markov decision processes with vector-valued terminal reward and multiple running cost constraints is considered. Applying the idea of occupation measures and using the scalarization technique for vector maximization problems we obtain the equivalent Mathematical Programming problem and show the existence of a Pareto optimal pair of stationary policy and stopping time requiring randomization in at most k states, where k is the number of constraints. Moreover Lagrange multiplier approaches are considered. The saddle-point statements are given, whose results are applied to obtain a related parametric Mathematical Programming, by which the problem is solved. Numerical examples are given.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Manuscript received: February 2001/Final version received: June 2001

Rights and permissions

Reprints and permissions

About this article

Cite this article

Horiguchi, M. Stopped Markov decision processes with multiple constraints. Mathematical Methods of OR 54, 455–469 (2001). https://doi.org/10.1007/s001860100160

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001860100160

Navigation