Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 215,142,045 papers from all fields of science
Search
Sign In
Create Free Account
Linear programming
Known as:
Linear programme
, Linear programmers
, LP problem
Expand
Linear programming (LP) (also called linear optimization) is a method to achieve the best outcome (such as maximum profit or lowest cost) in a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
AMPL
APMonitor
APOPT
Active set method
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
Linear Programming
Y. Rabani
Handbook of Approximation Algorithms and…
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…
Expand
Highly Cited
2005
Highly Cited
2005
Decoding by linear programming
E. Candès
,
T. Tao
IEEE Transactions on Information Theory
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…
Expand
Highly Cited
2004
Highly Cited
2004
Linear Programming Under Uncertainty
G. Dantzig
Management Sciences
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…
Expand
Highly Cited
2000
Highly Cited
2000
Linear Programming and Extensions
P. Nicola
2000
Corpus ID: 60023657
During the Second World War a set of mathematical techniques were invented, to help formulate and solve some military and…
Expand
Highly Cited
1998
Highly Cited
1998
Linear Programming: Foundations and Extensions
R. Vanderbei
Kluwer international series in operations…
1998
Corpus ID: 119722553
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
A new polynomial-time algorithm for linear programming
N. Karmarkar
Symposium on the Theory of Computing
1984
Corpus ID: 7257867
We present a new polynomial-time algorithm for linear programming. In the worst case, the algorithm requiresO(n3.5L) arithmetic…
Expand
Highly Cited
1973
Highly Cited
1973
Technical Note - Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
A. Soyster
Operational Research
1973
Corpus ID: 44399062
This note formulates a convex mathematical programming problem in which the usual definition of the feasible region is replaced…
Expand
Highly Cited
1965
Highly Cited
1965
Linear programming and extensions
G. Dantzig
Mathematical Gazette
1965
Corpus ID: 123462079
In real-world problems related to finance, business, and management, mathematicians and economists frequently encounter…
Expand
Highly Cited
1961
Highly Cited
1961
A Linear Programming Approach to the Cutting-Stock Problem
P. Gilmore
,
R. Gomory
1961
Corpus ID: 8079477
The cutting-stock problem is the problem of filling an order at minimum cost for specified numbers of lengths of material to be…
Expand
Highly Cited
1960
Highly Cited
1960
Decomposition Principle for Linear Programs
G. Dantzig
,
P. Wolfe
1960
Corpus ID: 61768820
A technique is presented for the decomposition of a linear program that permits the problem to be solved by alternate solutions…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE