
related topics 
{math, number, function} 
{company, market, business} 
{rate, high, increase} 
{food, make, wine} 
{math, energy, light} 
{island, water, area} 
{land, century, early} 
{area, part, region} 

Linear programming (LP) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.
More formally, linear programming is a technique for the optimization of a linear objective function, subject to linear equality and linear inequality constraints. Given a polytope and a realvalued affine function defined on this polytope, a linear programming method will find a point on the polytope where this function has the smallest (or largest) value if such point exists, by searching through the polytope vertices.
Linear programs are problems that can be expressed in canonical form:
where x represents the vector of variables (to be determined), c and b are vectors of (known) coefficients and A is a (known) matrix of coefficients. The expression to be maximized or minimized is called the objective function (c^{T}x in this case). The equations Ax ≤ b are the constraints which specify a convex polytope over which the objective function is to be optimized. (In this context, two vectors are comparable when every entry in one is lessthan or equalto the corresponding entry in the other. Otherwise, they are incomparable.)
Linear programming can be applied to various fields of study. It is used most extensively in business and economics, but can also be utilized for some engineering problems. Industries that use linear programming models include transportation, energy, telecommunications, and manufacturing. It has proved useful in modeling diverse types of problems in planning, routing, scheduling, assignment, and design.
Contents
Full article ▸


related documents 
Combinatory logic 
Relational model 
Big O notation 
Prolog 
System of linear equations 
Laplace transform 
Spinor 
Quadratic reciprocity 
Redblack tree 
Banach–Tarski paradox 
Formal power series 
Lebesgue integration 
Fibonacci number 
Wikipedia:Free Online Dictionary of Computing/R  S 
Trigonometric functions 
Lambda calculus 
Padic number 
Determinant 
Field (mathematics) 
Travelling salesman problem 
Binomial coefficient 
Discrete cosine transform 
Grothendieck topology 
Linked list 
Bernoulli number 
Binary search algorithm 
Computer numbering formats 
Pythagorean triple 
Original proof of Gödel's completeness theorem 
Μrecursive function 
