Skip to search formSkip to main contentSkip to account menu

Linear programming

Known as: Linear programme, Linear programmers, LP problem 
Linear programming (LP) (also called linear optimization) is a method to achieve the best outcome (such as maximum profit or lowest cost) in a… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
  • Y. Rabani
  • 2007
  • Corpus ID: 1124183
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… 
Highly Cited
2005
Highly Cited
2005
  • E. CandèsT. Tao
  • 2005
  • Corpus ID: 12605120
This paper considers a natural error correcting problem with real valued input/output. We wish to recover an input vector f/spl… 
Highly Cited
2004
Highly Cited
2004
  • G. Dantzig
  • 2004
  • Corpus ID: 36167235
(This article originally appeared in Management Science, April-July 1955, Volume 1, Numbers 3 and 4, pp. 197-206, published by… 
Highly Cited
2000
Highly Cited
2000
During the Second World War a set of mathematical techniques were invented, to help formulate and solve some military and… 
Highly Cited
1998
Highly Cited
1998
  • R. Vanderbei
  • 1998
  • Corpus ID: 119722553
Preface. Part 1: Basic Theory - The Simplex Method and Duality. 1. Introduction. 2. The Simplex Method. 3. Degeneracy. 4… 
Highly Cited
1984
Highly Cited
1984
  • N. Karmarkar
  • 1984
  • Corpus ID: 7257867
We present a new polynomial-time algorithm for linear programming. In the worst case, the algorithm requiresO(n3.5L) arithmetic… 
Highly Cited
1973
Highly Cited
1973
  • A. Soyster
  • 1973
  • Corpus ID: 44399062
This note formulates a convex mathematical programming problem in which the usual definition of the feasible region is replaced… 
Highly Cited
1965
Highly Cited
1965
  • G. Dantzig
  • 1965
  • Corpus ID: 123462079
In real-world problems related to finance, business, and management, mathematicians and economists frequently encounter… 
Highly Cited
1961
Highly Cited
1961
The cutting-stock problem is the problem of filling an order at minimum cost for specified numbers of lengths of material to be… 
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…