Note on a class of admission control policies for the stochastic knapsack problem

  • Authors:

  • Adriana F. Gabor;Jan-Kees C. W. van Ommeren

  • Affiliations:

  • EURANDOM and Faculty of Mathematics and Computer Science, TUE, Eindhoven, The Netherlands;Faculty of Electrical Engineering, Mathematics and Computer Science, University of Twente, Enschede, The Netherlands

  • Venue:
  • AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this note we discuss a class of exponential penalty function policies recently proposed by Iyengar and Sigman for controlling a stochastic knapsack. These policies are based on the optimal solution of some related deterministic linear programs. By finding explicitly their optimal solution, we reinterpret the exponential penalty function policies and show that they belong to the class of threshold policies. This explains their good practical behavior, facilitates the comparison with the thinning policy, simplifies considerably their analysis and improves the bounds previously proposed.