Linear Programming Algorithm

A Linear Programming Algorithm is an continuous optimization algorithm that can solve a linear programming task.

• AKA: Linear Programming, Linear Programming Technique.
• Context:
  • It can be a Binary Linear Programming Algorithm.
• Example(s):
  • a Simplex Algorithm.
  • an Interior Point Optimization Algorithm.
• See: Dynamic Programming Algorithm Strategy, Quadratic Programming Algorithm, Linear Programming Relaxation.

---

---

References

2009

• (Wikipedia, 2009) ⇒ http://en.wikipedia.org/wiki/Linear_programming
  • In mathematics, linear programming (LP) is a technique for optimization of a linear objective function, subject to linear equality and linear inequality constraints. Informally, linear programming determines the way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model and given some list of requirements represented as linear equations.

---