Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2007

Highly Cited

2007

i=1 ajixi ≤ bj for 1 ≤ j ≤ m We can also minimize instead of maximize. The function ∑n i=1 cixi is known as the objective… Expand

Highly Cited

2005

Highly Cited

2005

This paper considers a natural error correcting problem with real valued input/output. We wish to recover an input vector f/spl… Expand

Highly Cited

2004

Highly Cited

2004

(This article originally appeared in Management Science, April-July 1955, Volume 1, Numbers 3 and 4, pp. 197-206, published by… Expand

Highly Cited

1998

Highly Cited

1998

Preface. Part 1: Basic Theory - The Simplex Method and Duality. 1. Introduction. 2. The Simplex Method. 3. Degeneracy. 4… Expand

Highly Cited

1984

Highly Cited

1984

We present a new polynomial-time algorithm for linear programming. In the worst case, the algorithm requiresO(n3.5L) arithmetic… Expand

Highly Cited

1981

Highly Cited

1981

Formulation skills for problems as a deterministic linear mathematical model (linear programming, goal (multi-objective… Expand

Highly Cited

1977

Highly Cited

1977

One: Introduction.Two: Linear Algebra, Convex Analysis, and Polyhedral Sets.Three: The Simplex Method.Four: Starting Solution and… Expand

Highly Cited

1965

Highly Cited

1965

George Dantzig is properly acclaimed as the “father of linear programming.” Linear programming is a mathematical technique used… Expand

Highly Cited

1963

Highly Cited

1963

In real-world problems related to finance, business, and management, mathematicians and economists frequently encounter… Expand

Highly Cited

1960

Highly Cited

1960

A technique is presented for the decomposition of a linear program that permits the problem to be solved by alternate solutions… Expand