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, 1958
A consideration of a linear-programming problem in which the "right-hand side" is a random vector whose expected value is known and where the expected value of the objective function is minimized. The conditions are studied under which an approximate...
The development of a variant to a recent result of Gomory (Princeton).
Expert Insights
Jan 1, 1957
A survey of the kinds of structures encountered and the methods proposed for solving multistage linear programming problems. The single and multicommodity warehouse problem is used to illustrate some basic ideas. In addition, the study discusses the ...
A discussion of operations research as a new science of decisionmaking. The role of analytic models in Operations Research is considered, together with computational, criterion, and data problems....
A discussion of limit analysis, which provides the structural engineer with a realistic estimate of the load-carrying capacities of structures made of ductile materials. The problem of limit analysis is one of linear programming, and a method of solu...
A discussion of limit design, which guides the structural engineer toward an economic design of structures that are made of ductile materials and have to carry specified loads. The problem can be reduced to one in linear programming, and a method of ...
The use of the functional equation approach of dynamic programming to treat a linear programming problem. This problem involves a slightly intertwined matrix, i.e., one which is almost block diagonal....
A technique for bounding variables in a linear programming problem, together with several applications. These restraints can be applied without greatly increasing the computational effort....
The use of the functional equation approach of dynamic programming to treat a linear programming problem. This problem involves a slightly intertwined matrix, i.e., one which is almost block diagonal.
A proof that an algorithm for the most efficient assignment of machines to tasks solves an equivalent linear-programming problem.
An outline of a method for constructing maximal dynamic flow from static flow and a presentation of a simple proof of maximality.