LINEAR PROGRAMMING
Charles François (2004). LINEAR PROGRAMMING, International Encyclopedia of Systems and Cybernetics, 2(1): 1921.
| Collection | International Encyclopedia of Systems and Cybernetics |
|---|---|
| Year | 2004 |
| Vol. (num.) | 2(1) |
| ID | ◀ 1921 ▶ |
| Object type | Discipline oriented |
- “A combined analytical and decision-making technique based on mathematical programming” (I,G. BLOOR, 1988, p.24).
Linear programming uses algebraic and graphical methods in search of the optimal solution.
I.G. BLOOR explains that the aim is to find a suitable equilibrium between “objectives (e.g. maximize profits, minimize waste) and constraints (resources that are scarce, time)”. He adds that: “The choice of method depends on the number of variables under consideration: more than two require algebraic (or computer) solutions”.
He states that the technique is usable “… to provide feasible solutions to problems where the alternatives seem infinite or non-existent” (1988, p. 24).
Truly complex situations however frequently cannot be treated by linaer programming.