Paper #301

Títol:

Restless bandits, linear programming relaxations and a primal-dual index heuristic

Autors:

Dimitris Bertsimas i José Niño-Mora

Data:

Agost 1994

Resum:

We develop a mathematical programming approach for the classical PSPACE - hard restless bandit problem in stochastic optimization. We introduce a hierarchy of n (where n is the number of bandits) increasingly stronger linear programming relaxations, the last of which is exact and corresponds to the (exponential size) formulation of the problem as a Markov decision chain, while the other relaxations provide bounds and are efficiently computed. We also propose a priority-index heuristic scheduling policy from the solution to the first-order relaxation, where the indices are defined in terms of optimal dual variables. In this way we propose a policy and a suboptimality guarantee. We report results of computational experiments that suggest that the proposed heuristic policy is nearly optimal. Moreover, the second-order relaxation is found to provide strong bounds on the optimal value.

Paraules clau:

Stochastic scheduling, bandit problems, resource allocation, dynamic programming

Codis JEL:

C60, C61

Àrea de Recerca:

Microeconomia

Publicat a:

Operations Research, 48, 1, (2000), pp. 80-90

Descarregar el paper en format PDF