scispace - formally typeset
A

Abraham Charnes

Researcher at University of Texas at Austin

Publications -  222
Citations -  68762

Abraham Charnes is an academic researcher from University of Texas at Austin. The author has contributed to research in topics: Linear programming & Data envelopment analysis. The author has an hindex of 57, co-authored 222 publications receiving 63459 citations. Previous affiliations of Abraham Charnes include Carnegie Institution for Science & Northwestern University.

Papers
More filters
Journal ArticleDOI

Search-Theoretic Models of Organization Control by Budgeted Multiple Goals

TL;DR: In this paper, a model of situations in which individuals are faced with multiple activities among which they must allocate their effort is postulated, and optimal allocations are found for four assumed motivational structures, i.e., profit maximization, performance goals in each of the activities, and relationships between the various motivation structures are explored.
ReportDOI

Extreme point solutions in mathematical programming: an opposite sign algorithm

TL;DR: In this paper it is shown how part of the technique of proof of the opposite sign theorem can be employed in a simple algorithm to achieve this end and is equally valid when maximizing a nonlinear but convex objective function.
Journal ArticleDOI

Demon: a management model for marketing new products.

TL;DR: DecDecision Mapping via Optimum GO-NO Networks (DEMON) as discussed by the authors is a chance-constrained programming model for use in developing a strategy for marketing new products where, inter alia, the pertinent statistical distributions are only partially known and, in fact, may change in response to the strategies employed.
ReportDOI

Intertemporal bank asset choice with stochastic dependence

TL;DR: In this article, the authors extend existing models of inter-temporal bank asset management in the following respects: bank customers are identified, with requirements that their demands for loan renewals be satisfied.
Journal ArticleDOI

Some Properties of Redundant Constraints and Extraneous Variables in Direct and Dual Linear Programming Problems

TL;DR: In this article, it is shown that a bounded solution set in one problem implies an unbounded solution set for another problem, unless both are one-point sets, and the ideas of projection equivalence are then developed to suggest a possible route for utilizing these onepoint solution properties for analyzing or solving linear programming problems.