Jump to content

Linear programming

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 193.117.101.193 (talk) at 04:17, 11 March 2002 (*stub). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Linear Programming is a technique used to resolve problems which typically involve a large number of variables and where in many cases there is insufficient definition of the inter-relationship of these variables to solve a unique solution.

By definition the relationship between the variables involves linear equations although the technique can be used in some non-linear situation. Often the goal is to either minimise a cost or maximise a value. Some equations can make use of inequality symbols and in some situations more than goal may be defined.