Quadratic resource allocation with generalized upper bounds

1997 ◽  
Vol 20 (2) ◽  
pp. 51-57 ◽  
Author(s):  
Kurt M. Bretthauer ◽  
Bala Shetty
Keyword(s):  
Resource Allocation ◽  
Upper Bounds ◽  
Generalized Upper Bounds

Resource Allocation in Multicast OFDM Systems: Lower/Upper Bounds and Suboptimal Algorithm

2011 ◽  
Vol 15 (7) ◽  
pp. 722-724 ◽  
Author(s):  
Wenjun Xu ◽  
Kai Niu ◽  
Jiaru Lin ◽  
Zhiqiang He
Keyword(s):  
Resource Allocation ◽  
Upper Bounds ◽  
Ofdm Systems ◽  
Lower Upper

Bounds for discounted stochastic scheduling problems

1991 ◽  
Vol 28 (04) ◽  
pp. 791-801
Author(s):  
K. D. Glazebrook
Keyword(s):  
Resource Allocation ◽  
Policy Evaluation ◽  
Stochastic Scheduling ◽  
Upper Bounds ◽  
The Other ◽  
Stochastic Environment ◽  
Scheduling Problems ◽  
Total Reward

Suppose that π is a policy for resource allocation in a stochastic environment and π ∗ is an optimal policy. Two existing procedures for policy evaluation are described and compared. Both of these evaluate π by means of upper bounds on R(π ∗) – R(π), the total reward lost when making resource allocations according to π rather than π∗. The bounds developed by these two methods are called Type 1 and Type 2. We demonstrate by example that neither of these procedures dominates the other in the sense of always yielding tighter bounds. A modification to Type 2 bounds is proposed resulting in an improved procedure which always dominates the Type 1 approach.

Sign in / Sign up

Export Citation Format

Share Document