作者: Saul I. Gass
DOI: 10.1016/0305-0548(87)90025-6
关键词: Decision maker 、 Set (abstract data type) 、 Simplex 、 Statement (computer science) 、 Relevance (information retrieval) 、 Mathematical optimization 、 Operations research 、 Mathematics 、 Linear goal programming
摘要: Abstract It is the author's view that preemptive linear-goal programming and its associated simplex-based allgorithm too restrictive in ability to search out an acceptable solution imposes unrealistic burden on decision maker by requiring a statement of strict priorities. Also, question goal norming one has little relevance terms what basic problem really is: i.e. finding suitable set objective function weights can be applied over- under-achievement deviation variables. This paper describes why author reached these conclusions, his approach for solving large-scale programs.