Format:
Online Ressource (15176 KB, 136 S.)
Edition:
1. Aufl.
Edition:
Online-Ausg.
ISBN:
0080406610
Content:
Goal Programming (GP) is perhaps the oldest and most widely used approach within the Multiple Criteria Decision Making (MCDM) paradigm. GP combines the logic of optimisation in mathematical programming with the decision maker's desire to satisfy several goals. The primary purpose of this book is to identify the critical issues in GP and to demonstrate different procedures capable of avoiding or mitigating the inherent pitfalls associated with these issues. The outcome of a search of the literature shows many instances where GP models produced misleading or even erroneous results simply because of a careless formulation of the problem. Rather than being in itself a textbook, Critical Issues in Goal Programmingis designed to complement existing textbooks. It will be useful to students and researchers with a basic knowledge of GP as well as to those interested in building GP models which analyse real decision problems.
Note:
Description based upon print version of record
,
Front Cover; Handbook of Critical Issues in Goal Programming; Copyright Page; Dedication; Table of Contents; Preface; Acknowledgements; Chapter 1. An Introductory Overview of Goal Programming (GP) and some Related Multiple Criteria Decision Making (MCDM) Approaches1; 1. Some Basic Concepts; 2. Goal Programming; 3. Multiobjective Programming; 4. Compromise Programming; 5. A Concluding Remark; Bibliographical Notes; References; Chapter 2. Paretian Efficiency in Goal Programming (In collaboration with Tahir Rehman); 1. An Introduction to the Problem; 2. A Test of Efficiency in GP
,
3. Generation of a Set of GP-Efficient Solutions: Hannan's Procedure4. A General Framework for Solving GP Models Avoiding Inferior Solutions; 5. An Illustrative Case of Dominated Solutions in LGP; 6. Concluding Remarks; Bibliographical Notes; References; Chapter 3. Good and Poor Modelling Practices in Goal Programming; 1. An Introduction to the Problem; 2. Equivalence of Solutions between GP and LP Models; 3. Logical Structure of an Achievement Function; 4. Logical Structure of a Goal; 5. Unnecessary Inclusion of Two-sided Goals; 6. Naive Setting of Weights in GP
,
Annex: Utility Functions and LGPBibliographical Notes; Chapter 4. Naive Prioritization and Redundancy in LGP1 (In collaboration with Francisco Amador); 1. An Introduction to the Problem; 2. Redundant Goals and Lexicographic Optimization; 3. Redundancy in the LGP Literature; 4. Conclusions; Bibliographical Notes; References; Chapter 5. Hidden Nonlinearities in Linear Goal Programming Models1; 1. An Introduction to the Problem; 2. Direct Linearization of Fractional Goals; 3. The Soyster, Lev and Hannan Test; 4. Linearization of Posynomial Goals by Logarithmic Transformations
,
5. Logarithmic Transformations and Geometric Average Utility FunctionsBibliographical Notes; References; Chapter 6. Goal Programming with Penalty Functions; 1. An Introduction to the Problem; 2. The U-Shaped Penalty Function and the Double Counting Effect; 3. Some Methods to Remove the Double Counting Effect; 4. An Illustrative Example; Bibliographical Notes; References; Chapter 7. Relationship between Goal Programming (GP), Multiobjective Programming (MOP) and Compromise Programming (CP); 1. An Introduction to the Problem; 2. Mathematical Programming and Distance Function Models
,
3. The Links between GP, MOP and CP4. Concluding Remarks; Bibliographical Notes; References; Chater 8. GP Applications: A Categorized Bibliographical Survey; 1. Introduction; 2. Classification Scheme; 3. Agricultural and Natural Resources Planning and GP; 4. An Assessment; References not included in the categorized bibliography; Chapter 9. A Categorized Bibliography on GP Applications; Chapter 10. Epilogue; References; Index
Additional Edition:
1483295117
Additional Edition:
9781483295114
Additional Edition:
Print version Handbook of Critical Issues in Goal Programming
Language:
English
Keywords:
Electronic books
Bookmarklink
