Goal programming sensitivity analysis using interval penalty weights
- 145 Downloads
This paper presents an application of the vector-maximum research [4–8] to the sensitivity analysis of goal programming problems as several of the criterion function penalty weights are simultaneously and independently varied. A generalized goal programming capability is presented and a six-stage analytic procedure is described. The problem is generalized in the sense that the regular goal programming penalty weights can be expanded to intervals if desired. The solution procedure is new in that it depends upon an algorithm for the vector-maximum problem, “criterion cone” contraction procedures, and “filtering” techniques. Together they are able to generate and process all extreme points on the portion of the surface of the goal programming “augmented” feasible region corresponding to the interval penalty weights specified. In effect, the procedure and adapted algorithm of this paper delivers to goal programming an operational power of sensitivity analysis not previously available to users. A numerical example is provided in order to illustrate the computerized application of the total goal programming procedure outlined.
Key wordsGoal Programming Sensitivity Analysis Vector-Maximum Algorithms Multiple Objective Linear Programming Multiple Criteria Decision Making
Unable to display preview. Download preview PDF.
- J.G. Ecker and I.A. Kouada, “Finding efficient points for linear multiple objective programs”,Mathematical Programming 8 (1975) 375–377.Google Scholar
- R.L. Keeney and H. Raiffa,Decisions with multiple objectives: Preferences and value tradeoffs (Wiley, New York, 1976).Google Scholar
- B. Roy, “How outranking relation helps multiple criteria decision making”, in: J.L. Cochrane and M. Zeleny, eds.,Multiple criteria decision making (University of South Carolina Press, 1973) pp. 179–201.Google Scholar
- R.E. Steuer, “Interval criterion weights programming: A portfolio selection example, gradient cone modification, and computational experience”,Proceedings: Tenth annual southeastern regional TIMS meeting (1974) pp. 246–255.Google Scholar
- R.E. Steuer, “ADBASE: An adjacent efficient basis algorithm for vector-maximum and interval weighted-sums linear programming problems”,Journal of Marketing Research 12 (1975) 454–455.Google Scholar
- R.E. Steuer, “Multiple objective linear programming with interval criterion weights”,Management Science 23 (3) (1976) 305–316.Google Scholar
- R.E. Steuer, “Operating manual for the ADBASE/FILTER computer package for solving multiple objective linear programming problems”, (Release: 5/78), College of Business and Economics, University of Kentucky (1978).Google Scholar
- R.E. Steuer, “Vector-maximum gradient cone contraction techniques”, in: S. Zionts, ed.,Multiple criteria problem solving, Lecture Notes in Economics and Mathematical Systems, Vol. 155 (Springer, Berlin, 1978) pp. 462–481.Google Scholar