Note—Blau's Dilemma Revisited
Abstract
The issue of equivalence between chance-constrained programming problems (CCPP's) and Bayesian utility-maximization problems (BUMP's), and the anomalous evaluation of information in CCPP's, are re-examined in light of a recent paper by Jagannathan and the ensuing exchange between Jagannathan and LaValle. Difficulties in “explaining” value of information within the framework of chance-constrained programming are illustrated in a numerical example due to Jagannathan.

