The achievable region approach seeks solutions to stochastic optimization p
roblems by characterizing the space of all possible performances (the achie
vable region) of the system of interest and optimizing the overall system-w
ide performance objective over this space. This is radically different from
conventional formulations based on dynamic programming. The approach is ex
plained with reference to a simple two-class queuing system. Powerful new m
ethodologies due to the authors and co-workers are deployed to analyse a ge
neral multiclass queuing system with parallel servers and then to develop a
n approach to optimal load distribution across a network of interconnected
stations. Finally, the approach is used for the first time to analyse a cla
ss of intensity control problems.