Workload reduction of a generalized Brownian network

Details Workload reduction of a generalized Brownian network Workload reduction of a generalized Brownian network

2006-02-22

arxiv.org/abs/math/0602495v1

Annals of Applied Probability 2005, Vol. 15, No. 4, 2255-2295

Mathematics

Probability

Published at http://dx.doi.org/10.1214/105051605000000458 in the Annals of Applied Probability (http://www.imstat.org/aap/) by

Scientific paper

10.1214/105051605000000458

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.

Affiliated with

Also associated with

No associations

Rating

Workload reduction of a generalized Brownian network does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Workload reduction of a generalized Brownian network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Workload reduction of a generalized Brownian network will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-89152