A variant of the simplex method designed to solve block-angular linear programs in which the blocks define subproblems. The problem is transformed into one that finds a solution in terms of convex combinations of the extreme points of the subproblems.
CITATION STYLE
Cooper, W. W. (2013). Data Envelopment Analysis. In Encyclopedia of Operations Research and Management Science (pp. 349–358). Springer US. https://doi.org/10.1007/978-1-4419-1153-7_212
Mendeley helps you to discover research relevant for your work.