The setting of weights in linear goal-programming problems

Abstract It is the author's view that preemptive linear-goal programming and its associated simplex-based allgorithm is too restrictive in its ability to search out an acceptable solution and imposes an unrealistic burden on the decision maker by requiring a statement of strict preemptive priorities. Also, the question of goal norming is one that has little relevance in terms of what the basic problem really is: i.e. finding a suitable set of objective function weights that can be applied to the over- and under-achievement deviation variables. This paper describes why the author has reached these conclusions, and his approach for solving large-scale goal programs.