W
William W. Cooper
Researcher at University of Texas at Austin
Publications - 254
Citations - 82692
William W. Cooper is an academic researcher from University of Texas at Austin. The author has contributed to research in topics: Data envelopment analysis & Linear programming. The author has an hindex of 79, co-authored 254 publications receiving 76641 citations. Previous affiliations of William W. Cooper include Harvard University & Carnegie Mellon University.
Papers
More filters
Book ChapterDOI
Choices and Uses of DEA Weights
TL;DR: Different approaches that allow incorporating into the analysis price information, reflecting meaningful trade-offs, incorporating value information and managerial goals, making a choice among alternate optima for the weights, avoiding non-zero weights, and avoiding large differences in the values of multipliers are described.
Journal ArticleDOI
Abraham Charnes and W. W. Cooper et al.: A Brief History of a Long Collaboration in Developing Industrial Uses of Linear Programming
TL;DR: A research strategy and its results, which guided a 40+ year collaboration between Abraham Charnes and William W. Cooper, which was initiated in a research center established at the (then) new Graduate School of Industrial Administration at Carnegie Institute of Technology.
Journal ArticleDOI
A Model for Programming and Sensitivity Analysis in an Integrated Oil Company
Journal ArticleDOI
Demon: Decision Mapping Via Optimum Go-No Networks—A Model for Marketing New Products
TL;DR: Although it is related to previous work in chance constrained programming, DEMON evidently also effects a further development and extension of these ideas by reference to the fact that here the statistical distributions are only partially known and the chance constraints are also expressed in terms of conditional distributions which in turn may be altered by the choices that are made.
Journal ArticleDOI
Fundamental theorems of nondominated solutions associated with cones in normed linear spaces
TL;DR: In this paper, the essential properties of multiobjective programming in real normed linear spaces are studied and necessary and sufficient conditions for nondominated solutions under regularity and Frechet differentiability assumptions are developed.