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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1952-2017
01000200019522016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
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… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2005
Highly Cited
2005
A new method is given for performing approximate maximum-likelihood (ML) decoding of an arbitrary binary linear code based on… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Convex programming is a subclass of nonlinear programming (NLP) that unifies and generalizes least squares (LS), linear… (More)
  • figure 1
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2003
Highly Cited
2003
The curse of dimensionality gives rise to prohibitive computational requirements that render infeasible the exact solution of… (More)
  • figure 2
  • figure 3
  • figure 5
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Error-correcting codes are fundamental tools used to transmit digital information over unreliable channels. Their study goes back… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Optimal solutions of Linear Programming problems may become severely infeasible if the nominal data is slightly perturbed. We… (More)
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We treat in this paper Linear Programming (LP) problems with uncertain data. The focus is on uncertainty associated with hard… (More)
  • table 1
  • figure 2
Is this relevant?
Highly Cited
1984
Highly Cited
1984
We present a new polynomial-time algorithm for linear programming. The running-time of this algorithm is <italic>O</italic… (More)
Is this relevant?
Highly Cited
1984
Highly Cited
1984
It is demonstrated that the linear programming problem in d variables and n constraints can be solved in O(n) time when d is… (More)
Is this relevant?
Highly Cited
1982
Highly Cited
1982
Linear-time for Linear Programming in R2 and R3 are presented. The methods used are applicable for some other problems. For… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?