Comments on: "A policy improvement method for constrained average Markov decision processes" [Oper. Res. Lett. 35 (2007) 434-438]

Date

2009-01-01

Author

Serin, Yaşar Yasemin

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

75
views

0
downloads

Subject Keywords

Management Science and Operations Research, Industrial and Manufacturing Engineering, Software, Applied Mathematics

URI

https://hdl.handle.net/11511/44848

Journal

OPERATIONS RESEARCH LETTERS

DOI

https://doi.org/10.1016/j.orl.2008.10.002

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

A note on two-person zero-sum communicating stochastic games Avşar, Zeynep Müge (Elsevier BV, 2006-07-01) For undiscounted two-person zero-sum communicating stochastic games with finite state and action spaces, a solution procedure is proposed that exploits the communication property, i.e., working with irreducible games over restricted strategy spaces. The proposed procedure gives the value of the communicating game with an arbitrarily small error when the value is independent of the initial state.
Policies utilizing tactical inventory for service-differentiated customers Duran, Serhan; Simchi-Levi, David; Swann, Julie L. (Elsevier BV, 2008-03-01) We consider a manufacturer serving two customer classes where one wants the item immediately and the second receives a discount to accept a delay. We show that an (S, R, B) base-stock policy is optimal under differentiation and non-differentiation where S, R, and B are the order-up-to, reserve-up-to, and backlog-up-to amounts.
Special Issue on recent advances in continuous optimization on the occasion of the 25th European conference on Operational Research (EURO XXV 2012) Weber, Gerhard Wilhelm; Kruger, Alexander; Enrique Martinez-Legaz, Juan; Mordukhovich, Boris; Sakalauskas, Leonidas (2014-01-02)
Special issue: Optimization in the natural sciences Tchemisova, Tatiana; Freitas, Adelaide; Plakhov, Alexander; Weber, Gerhard Wilhelm (2015-06-03)
Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm Solyali, O.; Ozpeynirci, O. (Informa UK Limited, 2009-01-01) This study addresses the operational fixed job scheduling problem under spread time constraints. The problem is to select a subset of jobs having fixed ready times and deadlines for processing on identical parallel machines such that total weight of the selected jobs is maximised. We first give a mathematical formulation of the problem and then reformulate it using Dantzig-Wolfe decomposition. We propose a branch-and-price algorithm that works on the reformulation of the problem. Computational results show ...

Citation Formats

Y. Y. Serin, “Comments on: “A policy improvement method for constrained average Markov decision processes” [Oper. Res. Lett. 35 (2007) 434-438],” OPERATIONS RESEARCH LETTERS, pp. 69–69, 2009, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/44848.