RAND's divisions conduct research on a uniquely broad front for clients around the globe.
Most relevant regions
Research
Jan 1, 1954
The first of a series of papers on the determination of optimum solutions to systems of linear inequalities.
A procedure for solving the dual problem by means of variables associated with a basis that may have negative as well as positive values in the iterative process before an optimum is reached.
A proposal for avoiding certain undesirable features of Phase I of the simplex method (i.e., by the introduction of vectors on the basis that they are likely to be in the optimal solution of Phase II).
A proposal which combines the normal and dual algorithms, with some modifications, in order to determine an optimal solution in fewer iterations than by other methods.
A proof that the problem of determining the minimum number of carriers required to meet a fixed schedule of transportation can be made into a linear programming problem.
An attempt to develop short-cut computational methods for solving systems whose matrices may be described as block triangular.
A discussion of the need to compute large-scale systems of linear-programming problems. Various characteristics of some practical models, promising to lead to short-cut procedures, are indicated.
A proof of the minimal cut theorem, for a general network, which determines a simple computational procedure for achieving a maximal flow in planar networks.
Expert Insights
Nov 13, 1953
Using the technique of continuous approximation, approximate solutions to a number of important multi-stage scheduling problems are determined.
Jun 1, 1953
A discussion of dynamic programming, defined as a mathematical theory devoted to the study of multistage processes.
Jan 1, 1953
A discussion of an iterative procedure which yields the value of a game very rapidly. 15 pp....