Preference Order Stochastic Knapsack Problems: Methodological Issues

Abstract

A preference order dynamic programming model proposed in the literature for solving stochastic knapsack problems is shown to be somewhat limited from both the methodological and computational points of view. A counterexample is presented contradicting the optimality of a procedure designed for normal variates.