Programming under probabilistic constraints with a random technology matrix
András Prékopa · Mathematische Operationsforschung Statistik · 1974
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.