• Print Page
• eMail Page

Search website for :

Home→The Westburn Dictionary of Marketing→L→linear programming

linear programming

Definition:
A technique developed in 1949 by G. Danzig (USA) for setting out the mathematical relationships between a complicated set of conditions and making calculations to find the ideal or optimum solution to the problem. It is usually used to solve allocation problems and it is the relationship between objectives, activities and constraints expressed in 'straight line' (linear) algebraic form. Any linear programing problem can be expressed ill the following form:  Maximize Cj Xj Subject to AijXj <= bij for C =1,2, …, m and Xj >= 0 for j = 1, 2, …, n where X1, ... Xn are the decision variables and CjXj is the objective function and the two sets of inequalities are the constraints.

Cross-References:

Links:

Figures:

© Westburn Publishers Ltd 2002, The Westburn Dictionary of Marketing edited by Michael J Baker, ISBN 978-0-946433-01-8. www.themarketingdictionary.com. Entry: [George Avlonitis],.