Search arXiv⌕ Search

arXiv · 1510.06656

Continuous Inventory Models of Diffusion Type: Long-term Average Cost Criterion

Abstract

This paper establishes conditions for optimality of an $(s,S)$ ordering policy for the minimization of the long-term average cost of one-dimensional diffusion inventory models. The class of such models under consideration have general drift and diffusion coefficients and boundary points that are consistent with the notion that demand should tend to decrease the inventory level. Characterization of the cost of a general $(s,S)$ policy as a function $F$ of two variables naturally leads to a nonlinear optimization problem over the ordering levels $s$ and $S$. Existence of an optimizing pair $(s_*,S_*)$ is established for these models. Using the minimal value $F_*$ of $F$, along with $(s_*,S_*)$, a function $G$ is identified which is proven to be a solution of a quasi-variational inequality provided a simple condition holds. At this level of generality, optimality of the $(s_*,S_*)$ ordering policy is established within a large class of ordering policies such that local martingale and transversality conditions involving $G$ hold. For specific models, optimality of an $(s,S)$ policy in the general class of admissible policies can be established using comparison results. This most general optimality result is shown for the classical drifted Brownian motion inventory model with holding and fixed plus proportional ordering costs and for a geometric Brownian motion inventory model with fixed plus level-dependent ordering costs. However, for a drifted Brownian motion process with reflection at $\{0\}$, a new class of non-Markovian policies is introduced which have lower costs than the $(s,S)$ policies. In addition, interpreting reflection at $\{0\}$ as "just-in-time" ordering, a necessary and sufficient condition is given that determines when just-in-time ordering is better than traditional $(s,S)$ policies.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

K. L. Helmes, R. H. Stockbridge, C. Zhu. 2015-10-22. Continuous Inventory Models of Diffusion Type: Long-term Average Cost Criterion. https://arxiv.org/abs/1510.06656

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On the stability of proximal operators in Wasserstein spaces under different notions of convexity

The proximal operator is a fundamental tool in variational analysis and optimization. In the setting of a Hilbert space, given a proper, lower semicontinuous convex functional, its proximal operator is non-expansive, that is, 1-Lipschitz continuous. In the Wasserstein setting, the contraction properties of this operator have been investigated from different perspectives by Carlen and Craig and by Adve and Mészáros, among others, and are not completely understood. In this paper, we study the stability properties of proximal maps, with a particular focus on non-expansivity, under various notions of convexity of the functional that can be considered in the Wasserstein space.

math.OC↗

Symmetry-dependence in Rounding of a Convex Body

The symmetry measure of a convex body $S\subset\mathbb{R}^n$ is given by: $\mathrm{sym}(S):=\max\{α\ge0:\text{ there exists }x\in S\text{ such that }-α(S-x)\subseteq S-x\}$, where such an $x$ is called a Minkowski center. We prove that every convex body $S$ admits a $\sqrt{\frac{n}{\mathrm{sym}(S)}}$-rounding of $S$, namely, there exists an origin-centered ellipsoid $E$ and a center $c$ such that $E\subseteq S-c\subseteq\sqrt{\frac{n}{\mathrm{sym}(S)}}\,E$. This result was conjectured in 2005 by Belloni and Freund. As special cases, this recovers an $n$-rounding of $S$ (since $\mathrm{sym}(S)\ge\frac{1}{n}$), and a $\sqrt{n}$-rounding when $\mathrm{sym}(S)=1$. In the case when $S$ is a polytope given as the convex hull of points, the desired rounding is produced by a regularized minimum-volume covering ellipsoid problem where the regularization is with respect to the Minkowski center. Similarly, when $S$ is a polytope given as the intersection of halfspaces, such a rounding is produced by a regularized maximum-volume inscribed ellipsoid problem. In both of these cases, the rounding can be computed by first solving a linear optimization problem (to compute $\mathrm{sym}(S)$ and a Minkowski center), and then solving a convex optimization problem with a logarithmic determinant objective, second-order cone constraints, and one semidefinite cone constraint. We also show that the factor $\sqrt{\frac{n}{\mathrm{sym}(S)}}$ is nearly tight in its dependence on dimension and symmetry. When $\frac{n+1}{1+\mathrm{sym}(S)}$ is an integer, we show by explicit construction that the factor $\sqrt{\frac{n}{\mathrm{sym}(S)}}$ is tight. In the more general case, for every dimension $n$ and every admissible symmetry value, we construct a polytope $S$ for which every rounding factor is at least $\sqrt{\frac{2}{3}}\sqrt{\frac{n}{\mathrm{sym}(S)}}$.

math.OC↗

Improving the Last-Iterate Guarantees of Anytime Algorithms for Stochastic Monotone Variational Inequalities

We analyze a stochastic algorithm with Halpern-type anchoring for constrained convex-concave problems and monotone variational inequalities. This single-loop and single-call algorithm uses one unbiased sample of the gradient operator at every iteration, to be applicable to monotone games with noisy feedback. With $t$ denoting the iteration counter, we prove an anytime last-iterate convergence rate of $O(t^{-1/4})$ for both the gradient-mapping norm and restricted gap, bypassing the $O(t^{-1/5})$ constrained-anytime bottleneck in the literature. Specializing then to multi-point oracles, we use variance reduction to achieve the $O(t^{-1/2})$ rate with an anytime single-loop algorithm using $2$ samples per iteration. Our results allow constrained problems with a potentially unbounded feasible set; as well as a structured class of stochastic oracles whose variance need not be uniformly bounded.

math.OC↗