THE SETTING OF WEIGHTS IN LINEAR GOAL-PROGRAMMING PROBLEMS

作     者：GASS, SI 

作者机构：College of Business and Management University of Maryland College Park MD 20742 U.S.A. 

出 版 物：《COMPUTERS & OPERATIONS RESEARCH》 (计算机与运筹学研究)

年 卷 期：1987年第14卷第3期

页      面：227-229页

核心收录：

学科分类：1201[管理学-管理科学与工程(可授管理学、工学学位)] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：*SauI I. Gass received his B.S. in Education and M.A. in Mathematics from Boston University  and his Ph.D. in Engineering Science/Operations Research from the University of California  Berkeley. He is currently Professor in Management Science and Statistics  College of Business and Management  University of Maryland  College Park. Dr Gass began his career in operations research with the USAF Directorate of Management Analysis  and was Manager of Federal Civil Programs for IBM’s Federal Systems Division  Senior Vice-President of World Systems Laboratories  and Vice-President of Mathematics  Inc. He is a past President of the Operations Research Society of America  and is currently President of Omega Rho  the international honor society in operations research. His books include Linear Programming (McGraw-Hill  fifth edition) and Decision Making  Models and ~lgorjrhm~ (Wiley-Interscience). Dr Gass has jogged over lO ~miles in the major cities of the world  including Potomac  Maryland 

主　　题：MATHEMATICAL PROGRAMMING, LINEAR 

摘      要：Preemptive linear-goal programming and its related simplex-based algorithm 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 has little importance in terms of the basic problem -- finding a suitable set of objective-function weights that can be applied to the over- and under-achievement deviation variables. An approach for solving large-scale goal problems is described. For problems of special structure, the weighted objective method can utilize efficient computer codes directly, whereas the preemptive approach cannot.