RAND's divisions conduct research on a uniquely broad front for clients around the globe.
Research
Nov 8, 2021
Jan 20, 2021
Most relevant regions
Jan 1, 1954
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....
An illustration of certain algebraic solutions for linear-programming problems in order to show that in the case of reasonably simple problems these techniques are superior to the usual machine-methods...
A demonstration that the simplex procedure itself yields as a natural by-product proofs of several important theorems concerned with duality in the field of linear inequalities.
An extension of RM-1264 and RM-1265, Parts I and II, respectively, of Notes on Linear Programming. The present study presents the computational procedure.
A description of a finite iterative procedure, using a product form for the inverse. See also RM-1268/1.
Jan 1, 1952
A solution to a minimization problem which is used to treat a class of maximization problems. Possible applications of the results are discussed.
Jan 1, 1951
Aug 4, 1949
An extended study of the Le Chatelier principle which determines a cheapest diet conforming to prescribed nutritional standards.
