On the average-cost optimality equations and convergence of discounted-cost relative value functions for inventory control problems with quasiconvex cost functions

Author(s):  
Eugene A. Feinberg ◽  
Yan Liang
2010 ◽  
Vol 42 (01) ◽  
pp. 183-209 ◽  
Author(s):  
Arka P. Ghosh ◽  
Alexander Roitershtein ◽  
Ananda Weerasinghe

We consider a stochastic control model driven by a fractional Brownian motion. This model is a formal approximation to a queueing network with an ON-OFF input process. We study stochastic control problems associated with the long-run average cost, the infinite-horizon discounted cost, and the finite-horizon cost. In addition, we find a solution to a constrained minimization problem as an application of our solution to the long-run average cost problem. We also establish Abelian limit relationships among the value functions of the above control problems.


2010 ◽  
Vol 42 (1) ◽  
pp. 183-209 ◽  
Author(s):  
Arka P. Ghosh ◽  
Alexander Roitershtein ◽  
Ananda Weerasinghe

We consider a stochastic control model driven by a fractional Brownian motion. This model is a formal approximation to a queueing network with an ON-OFF input process. We study stochastic control problems associated with the long-run average cost, the infinite-horizon discounted cost, and the finite-horizon cost. In addition, we find a solution to a constrained minimization problem as an application of our solution to the long-run average cost problem. We also establish Abelian limit relationships among the value functions of the above control problems.


2021 ◽  
Author(s):  
John H. Vande Vate

This paper considers the problem of optimally controlling the drift of a Brownian motion with a finite set of possible drift rates so as to minimize the long-run average cost, consisting of fixed costs for changing the drift rate, processing costs for maintaining the drift rate, holding costs on the state of the process, and costs for instantaneous controls to keep the process within a prescribed range. We show that, under mild assumptions on the processing costs and the fixed costs for changing the drift rate, there is a strongly ordered optimal policy, that is, an optimal policy that limits the use of each drift rate to a single interval; when the process reaches the upper limit of that interval, the policy either changes to the next lower drift rate deterministically or resorts to instantaneous controls to keep the process within the prescribed range, and when the process reaches the lower limit of the interval, the policy either changes to the next higher drift rate deterministically or again resorts to instantaneous controls to keep the process within the prescribed range. We prove the optimality of such a policy by constructing smooth relative value functions satisfying the associated simplified optimality criteria. This paper shows that, under the proportional changeover cost assumption, each drift rate is active in at most one contiguous range and that the transitions between drift rates are strongly ordered. The results reduce the complexity of proving the optimality of such a policy by proving the existence of optimal relative value functions that constitute a nondecreasing sequence of functions. As a consequence, the constructive arguments lead to a practical procedure for solving the problem that is tens of thousands of times faster than previously reported methods.


2019 ◽  
Vol 34 (3) ◽  
pp. 429-468
Author(s):  
Eugene A. Feinberg ◽  
Yan Liang

This paper studies a periodic-review single-commodity setup-cost inventory model with backorders and holding/backlog costs satisfying quasiconvexity assumptions. We show that the Markov decision process for this inventory model satisfies the assumptions that lead to the validity of optimality equations for discounted and average-cost problems and to the existence of optimal (s, S) policies. In particular, we prove the equicontinuity of the family of discounted value functions and the convergence of optimal discounted lower thresholds to the optimal average-cost lower threshold for some sequence of discount factors converging to 1. If an arbitrary nonnegative amount of inventory can be ordered, we establish stronger convergence properties: (i) the optimal discounted lower thresholds converge to optimal average-cost lower threshold; and (ii) the discounted relative value functions converge to average-cost relative value function. These convergence results previously were known only for subsequences of discount factors even for problems with convex holding/backlog costs. The results of this paper also hold for problems with fixed lead times.


2021 ◽  
Vol 1821 (1) ◽  
pp. 012057
Author(s):  
Raka Iswara Prathama Setiawan ◽  
Julius Dharma Lesmono ◽  
Taufik Limansyah

2011 ◽  
Vol 2011 ◽  
pp. 1-11
Author(s):  
Epaminondas G. Kyriakidis

We introduce a Markov decision process in continuous time for the optimal control of a simple symmetrical immigration-emigration process by the introduction of total catastrophes. It is proved that a particular control-limit policy is average cost optimal within the class of all stationary policies by verifying that the relative values of this policy are the solution of the corresponding optimality equation.


Author(s):  
Alekos Cecchin

We examine mean field control problems  on a finite state space, in continuous time and over a finite time horizon. We characterize the value function of the mean field control problem as the unique viscosity solution of a Hamilton-Jacobi-Bellman equation in the simplex. In absence of any convexity assumption, we exploit this characterization to prove convergence, as $N$ grows, of the value functions of the centralized $N$-agent optimal control problem to the limit mean field control problem  value function, with a convergence rate of order $\frac{1}{\sqrt{N}}$. Then, assuming convexity, we show that the limit value function is smooth and establish propagation of chaos, i.e.  convergence of the $N$-agent optimal trajectories to the unique limiting optimal trajectory, with an explicit rate.


2019 ◽  
Vol 20 (3) ◽  
pp. 251-259 ◽  
Author(s):  
Ilya Jackson ◽  
Jurijs Tolujevs ◽  
Sebastian Lang ◽  
Zhandos Kegenbekov

Abstract Inventory control problems arise in various industries, and each single real-world inventory is replete with non-standard factors and subtleties. Practical stochastic inventory control problems are often analytically intractable, because of their complexity. In this regard, simulation-optimization is becoming more and more popular tool for solving complicated business-driven problems. Unfortunately, simulation, especially detailed, is both time and memory consuming. In the light of this fact, it may be more reasonable to use an alternative cheaper-to-compute metamodel, which is specifically designed in order to approximate an original simulation. In this research we discus metamodelling of stochastic multiproduct inventory control system with perishable products using a multilayer perceptron with a rectified linear unit as an activation function.


Sign in / Sign up

Export Citation Format

Share Document