George Bernard Dantzig

On a linear programming-combinatorial approach to the traveling salesman problem - 2004

Linear Programming and Extensions - 1963

Linear programming in a Markov chain: notes on linear programming and extensions-part 59. - 1962

The decomposition algorithm for linear programming: notes on linear programming and extensions-part 57. - 1961

Inductive proof of the simplex method. - 1960

Solving the chemical equilibrium problem using the decomposition principle. - 1960

A machine-job scheduling model. - 1959

A mathematical model of the human external respiratory system. - 1959

Computing Tetraethyl Lead Requirements in the Linear Programming Format - 1959

General convex objective forms. - 1959

New directions in mathematical programming. - 1959

On the shortest route through a network. - 1959

On the significance of solving linear-programming problems with some integer variables. - 1959

An equivalent linear-programming problem. - 1958

Notes on Linear Programming: Part XLVII Solving Linear Programs in Integers - 1958

On Integer and Partial Integer Linear Programming Problems - 1958

Solving Two-Move Games with Perfect Information - 1958

The dual of a transportation problem is not a transportation problem. - 1958

Chemical Equilibrium in Complex Mixtures - 1957

Concepts, Origins, and Use of Linear Programming. - 1957

On the status of multistage linear programming problems. - 1957

Upper Bounded Variables in Linear Programming. - 1957

Formulating a Linear Programming Model. - 1956

Notes on Linear Programming: Part XXXV — Discrete-Variable Extremum Problems - 1956

Notes on Linear Programming — Part XXXI: A Primal — Dual Algorithm - 1956

The Central Mathematical Problem. - 1956

The Simplex Method. - 1956

Thoughts on Linear Programming and Automation. - 1956

A Production Smoothing Problem. - 1955

Linear Programming under Uncertainty. - 1955

Notes on Linear Programming: Part XXII Recent Advances in Linear Programming - 1955

On the Max Flow Min Cut Theorem of Networks. - 1955

Constructive Proof of the Min-Max Theorem. - 1954

Notes on Linear Programming: Part XI Composite Simplex — Dual Simplex Algorithm — I - 1954

Notes on Linear Programming: Part I: The Generalized Simplex Method for Minimizing a Linear Form Under Linear Inequality Restraints - 1954

Notes on Linear Programming: Part VII The Dual Simplex Algorithm - 1954

Notes on Linear Programming: Part XVIII Status of Solution of Large-Scale Linear-Programming Problems - 1954

Notes on Linear Programming: Parts VIII, IX, and X Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming - 1954

Notes on Linear Programming: Part XV Minimizing the Number of Carriers to Meet a Fixed Schedule - 1954

Notes on Linear Programming--Part V: A Product-Form Tableau for Revised Simplex Method: Computing Appendix for RM-1268 - 1954

Solution of a Large-Scale Traveling-Salesman Problem. - 1954

The Problem of Routing Aircraft--A Mathematical Solution. - 1954

Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming - 1954

Notes on Linear Programming: Part V Alternate Algorithm for the Revised Simplex Method Using a Product Form for the Inverse - 1953

Notes on Linear Programming: Part II Duality Theorems - 1953

Notes on Linear Programming — Part III: Computational Algorithm of the Revised Simplex Method - 1953

The Product Form for the Inverse in the Simplex Method. - 1953

Algorithm for computing optimum distribution of local defense. - 1952

Comments on J. Von Neumann's "The Problem of Optimal Assignment on a Two-Person Game." - 1952

My RAND ?

Saved Items

Recommended

View My Profile
Order Online and Save 20 Percent View My Shopping Cart

Ordering Information

Search All Documents

Or Browse by Category:

Browse by Author

Browse by Document Series: