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, 1956
A procedure for solving transportation problems which is a natural extension of the Kuhn-Egerv*ary method for solving assignment problems. The present paper extends this procedure to the general linear programming case.
A description of a new computing procedure for the Hitchcock-Koopmans transportation problem and a step-by-step solution of an illustrative example.
A study which obtains a condition for the existence of a flow from the origins to the destinations (connected by a network of edges of specified finite capacity) such that the flows into the destinations attain prescribed values. The existence theore...
An algorithm for solving capacitated Hitchcock problems and a proof of convergence in a finite number of steps. The proposed algorithm is a generalization of a combinatorial method discovered by Kuhn for the optimal assignment problem.
A generalization of the minimum-cut, maximum-flow theorem to multicommodity networks. The generalization is expressed as a decomposition theorem that is established for these networks.
A review of some recent successes in the use of linear programming methods for solving discrete-variable extremum problems. One example of the use of the multistage approach of dynamic programming is also discussed.
Expert Insights
Jan 1, 1955
A discussion of a particular product form of matrix inverse which is closely related to the Gaussian elimination method of solving a set of simultaneous equations...
A method to determine in one iteration a basic feasible solution in the simplex method for solving linear programming problems when the right-hand side of an equation is altered...
A discussion of such developments in linear programming as uncertainty, combinatorial problems, and large-scale systems.