Concepedia

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

George B. Dantzig

Econometrica · 1955 · 140 citations · 6 references

DOI

Concepts

Abstract

Abstract : Short cut computational methods are developed for solving systems whose matrices may be generally described as block triangular.

References

6

The generalized simplex method for minimizing a linear form under linear inequality restraints

George B. Dantzig, Alexander Orden, Philip Wolfe · Pacific Journal of Mathematics · 1955 · 573 citations · Full text

, , +9

Optimality and Degeneracy in Linear Programming

A. Charnes · Econometrica · 1952 · 275 citations

, , +9

An Introduction to Linear Programming

D. G. O., A. Charnes, W. W. Cooper et al. · OR · 1953 · 242 citations

, , +8

The dual method of solving the linear programming problem

C. E. Lemke · Naval Research Logistics Quarterly · 1954 · 241 citations

, , +8

The product form for the inverse in the simplex method

George B. Dantzig, Wm. Orchard-Hays · Mathematics of Computation · 1954 · 80 citations · Full text

, , +4