Answers are grounded in this paper and cite their sources.
Probabilistic constraint of the type P (Ax ≦ β) ≧ p is proved that under some conditions the constraining function is quast-conceave. The probabilistic constraint is embedded into a mathematical programming problem of which the algorithmie solution is also discussed.
No takes yet. Share an insight, caveat, or question.
András Prékopa (1974) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: