scientific article; zbMATH DE number 3943536
[For the entire collection see Zbl 0568.00025.] A horizon property of a family of multicommodity inventory problems is investigated. The single problem is to schedule the production \(u=[u_ 1,...,u_ n]\in L^ 2([0,T)\); \(R^ n)\) so as to minimize the cost functional \[ (1)\quad F(u;r,T)=\int^{T}_{0}\{c(u_ 1(t)+...+u_ n(t))+h_ 1Y_ 1(t)+...+h_ nY_ n(t)\}dt \] under the constraints (2) \(\frac{d}{dt}Y_ i(t)=u_ i(t)-r_ i(t)\), \(Y_ i(0)=0\), (3) \(Y_ i(t)\geq 0\), \(u_ i(t)\geq 0\) \((i=1,2,...,n),\) where c(.) is assumed to be an increasing strictly convex and twice continuously differentiable functional, all \(r_ i\) are continuous and strictly positive functions, and all \(h_ i\) are some positive constants with \(h_ 1<h_ 2<...<h_ n\). Some necessary optimality conditions obtained by the maximum principle are formulated. Next, the vector function r and the number T are treated as parameters. The family of problems (1)-(3) indexed by \(T>0\) and \(r\in R_{b,B}=\{r|\) \(b\leq r_ 1(t)+...+r_ n(t)\leq B\}\) with \(0\leq b<B\) is considered. Let \(u_{T,r}\) be an optimal solution of (1)-(3) for the parameters \(T>0\) and \(r\in R_{b,B}\) and let \(H\geq (c'(B)-c'(b))/h_ 1\). It is proved that for all parameters T, \(T^*\) and for all parameters \(r,r^*\in R_{b,B}\) such that \(H<T<T^*\) and \(r^*=r\) on [0,T) and for all \(u_{T,r}\) there exist \(u_{T^*,r^*}\) such that \(u_{T,r}(t)=u_{T^*,r^*}(t)\) for \(t\in [0,T-H)\). This property has important managerial implications, since it makes the optimal production robust on the interval [0,T-H) with respect to the demands \(r^*\) which are posterior to \(T^*>T\).
- scientific article; zbMATH DE number 3916003
- Infinite horizon production planning in time-varying systems with convex production and inventory costs
- scientific article; zbMATH DE number 3915978
- scientific article; zbMATH DE number 3862891
- Inventory planning in a deterministic environment: Continuous time model with concave costs
- On the decomposition property for a dynamic inventory rationing problem with multiple demand classes and backorder
- Dynamic programming on the probabilistic inventory problems with multiple piecewise cost functions
- scientific article; zbMATH DE number 3916003 (Why is no real title available?)
- scientific article; zbMATH DE number 7647856 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3714883)