Robust Inventory Management: An Optimal Control Approach

摘要

We formulate and solve static and dynamic models of inventory management that lie at the intersection of robust optimization and optimal control theory. Our objective is to minimize cumulative ordering, holding, and shortage costs over a horizon [0, T], where the variable is a nonnegative ordering rate function q(t) ∈ ?2[0, T]. The demand rate function d(t) is unknown and is only assumed to belong to an uncertainty set Ω={d(t)∈L2[0,T]:μa≤(1/T)∫0Td(t)dt≤μb,a≤d(t)≤b,?t∈[0,T]}; this set is motivated by the strong law of large numbers for stochastic processes limT→∞(1/T)∫0Td(t)dt=μ, where μ is the mean drift. We analyze a static model, where the ordering rate function must be fully specified at time zero, and three dynamic variants, where re-optimizations are allowed during the planning horizon [0, T] at prespecified review epochs. In the dynamic models, at review epoch τ ∈ [0, T], the past demand on [0, τ) is observable. In the first dynamic model, we ignore this information, and define a variant of Ω that is well formed for the remaining planning horizon [τ, T]. In the second model, we define a variant of Ω for [τ, T] that utilizes the past demand information, though we make a simplifying technical assumption about the consistency of the demand on [0, τ) and Ω. In the third dynamic model, we remove this assumption, and we remedy the arising complications using the Hilbert Projection Theorem. In all cases we derive optimal closed-form ordering rate functions that equal either the bounds a or b, or weighted averages of these bounds (sb + ha)/(s + h) or (sa + hb)/(s + h), where s and h are the shortage and holding costs, respectively. The strategies differ by when these four ordering rates are applied, which is determined by an uncertainty-set-dependent partition of the remaining planning horizon. Computational experiments, focused on studying the dynamic variants, supplement the analytical results, and demonstrate that (1) the three variants exh