Goal Programming: Strengths and Weaknesses
Goal Programming: Strengths and Weaknesses
Goal programming is a branch of multiobjective optimization, which in turn is a branch of multi-criteria decision analysis (MCDA), also known as multiple-criteria decision making (MCDM). This is an optimization programme. It can be thought of as an extension or generalisation of linear programming to handle multiple, normally conflicting objective measures. Each of these measures is given a goal or target value to be achieved. Unwanted deviations from this set of target values are then minimised in an achievement function. This can be a vector or a weighted sum dependent on the goal programming variant used. As satisfaction of the target is deemed to satisfy the decision maker(s), an underlying satisficing philosophy is assumed. Goal programming is used to perform three types of analysis: 1. Determine the required resources to achieve a desired set of objectives. 2. Determine the degree of attainment of the goals with the available resources. 3. Providing the best satisfying solution under a varying amount of resources and priorities of the goals.
References
1. A Charnes, WW Cooper, R Ferguson (1955) Optimal estimation of executive compensation by linear programming, Management Science, 1, 138-151. 2. A Charnes, WW Cooper (1961) Management models and industrial applications of linear programming, Wiley, New York 3. 4. SM Lee (1972) Goal programming for decision analysis, Auerback, Philadelphia ^ JP Ignizio (1976) Goal programming and extensions, Lexington Books, Lexington, MA.
5. 6. 7. 8.
JP Ignizio, TM Cavalier (1994) Linear programming, Prentice Hall. C Romero (1991) Handbook of critical issues in goal programming, Pergamon Press, Oxford. MJ Scniederjans (1995) Goal programming methodology and applications, Kluwer publishers, Boston. DF Jones, M Tamiz (2002) Goal programming in the period 1990-2000, in Multiple Criteria Optimization: State of the art annotated bibliographic surveys, M. Ehrgott and X.Gandibleux (Eds.), 129-170. Kluwer
9.
10. RB Flavell (1976) A new goal programming formulation, Omega, 4, 731-732. 11. EL Hannan (1980) Non-dominance in goal programming, INFOR, 18, 300-309 12. M Tamiz, SK Mirrazavi, DF Jones (1999) Extensions of Pareto efficiency analysis to integer goal programming, Omega, 27, 179-188. 13. SI Gass (1987) A process for determining priorities and weights for large scale linear goal programmes, Journal of the Operational Research Society, 37, 779-785. 14. BJ White (1996) Developing Products and Their Rhetoric from a Single Hierarchical Model, 1996 Proceedings of the Annual Conference of the Society for Technical Communication, 43, 223-224.