Technical Note—A Simple Concavity Condition for a Class of Chance-Constrained Programming Problems with Joint Constraints

We obtain a simple sufficient condition for concavity for a class of chance-constrained programming problems with joint constraints that holds for most probability distributions of interest. Our result implies that for this class of chance-constrained problems, a global optimum can be obtained by using any one of several available concave programming algorithms.