LINEAR PROGRAMMING 5)
← Back
"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.
Categories
- 1) General information
- 2) Methodology or model
- 3) Epistemology, ontology and semantics
- 4) Human sciences
- 5) Discipline oriented
Publisher
Bertalanffy Center for the Study of Systems Science(2020).
To cite this page, please use the following information:
Bertalanffy Center for the Study of Systems Science (2020). Title of the entry. In Charles François (Ed.), International Encyclopedia of Systems and Cybernetics (2). Retrieved from www.systemspedia.org/[full/url]
We thank the following partners for making the open access of this volume possible: