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.
|Name||Lecture Notes in Computer Science|
|Conference||2nd International Conference on Algorithmic Aspects in Information and Management, AAIM 2006|
|Period||20/06/06 → 22/06/06|