Workload reduction of a generalized Brownian network

From MaRDI portal
Publication:2496491

DOI10.1214/105051605000000458zbMATH Open1096.60036arXivmath/0602495OpenAlexW2129842569MaRDI QIDQ2496491FDOQ2496491


Authors: J. Michael Harrison, R. J. Williams Edit this on Wikidata


Publication date: 10 July 2006

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Abstract: We consider a dynamic control problem associated with a generalized Brownian network, the objective being to minimize expected discounted cost over an infinite planning horizon. In this Brownian control problem (BCP), both the system manager's control and the associated cumulative cost process may be locally of unbounded variation. Due to this aspect of the cost process, both the precise statement of the problem and its analysis involve delicate technical issues. We show that the BCP is equivalent, in a certain sense, to a reduced Brownian control problem (RBCP) of lower dimension. The RBCP is a singular stochastic control problem, in which both the controls and the cumulative cost process are locally of bounded variation.


Full work available at URL: https://arxiv.org/abs/math/0602495




Recommendations




Cites Work


Cited In (7)





This page was built for publication: Workload reduction of a generalized Brownian network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2496491)