Satisficing DEA models under chance constraints

DEA (Data Envelopment Analysis) models and concepts are formulated here in terms of the ‘P-Models’ of Chance Constrained Programming, which are then modified to contact the ‘satisficing concepts’ of H.A. Simon. Satisficing is thereby added as a third category to the efficiency/inefficiency dichotomies that have heretofore prevailed in DEA. Formulations include cases in which inputs and outputs are stochastic, as well as cases in which only the outputs are stochastic. Attention is also devoted to situations in which variations in inputs and outputs are related through a common random variable. Extensions include new developments in goal programming with deterministic equivalents for the corresponding satisficing models under chance constraints.