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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
