Abstract
Consider a storage system where the content is driven by a Brownian motion in the absence of control. At any time, one may increase or decrease the content at a cost proportional to the amount of adjustment. A decrease of the content takes effect immediately, while an increase is realized after a fixed lead time [Formula: see text]. Holding costs are incurred continuously over time and are a convex function of the content. The objective is to find a control policy that minimizes the expected present value of the total costs. Because of the positive lead time for upward adjustments, one needs to keep track of all of the outstanding upward adjustments as well as the actual content at time [Formula: see text] as there may also be downward adjustments during [Formula: see text]—that is, the state of the system is a function on [Formula: see text]. We first extend the concept of [Formula: see text]-convexity to function spaces and establish the [Formula: see text]-convexity of the optimal cost function. We then derive various properties of the cost function and identify the structure of the optimal policy as a state-dependent two-sided reflection mapping making the minimum amount of adjustment necessary to keep the system states within a certain region.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.