Introduction to Linear Goal Programming

CONTENTS Series Editor's Introduction Acknowledgments 1. Introduction Purpose What Is Goal Programming? On the Use of Matrix Notation 2. History and Applications 3. Development of the LGP Model Notation The Baseline Model Terminology Additional Examples Conversion Process: Linear Programming LGP Conversion Procedure: Phase One LGP Conversion Process: Phase Two An Illustration Good and Poor Modeling Practices 4. An Algorithm for Solution The Transformed Model Basic Feasible Solution Associated Conditions Algorithm for Solution: A Narrative Description The Revised Multiphase Simplex Algorithm The Pivoting Procedure in LGP 5. Algorithm Illustration The Tableau Steps of Solution Procedure Listing the Results Additional Tableau Information Some Computational Considerations Bounded Variables Solution of LP and Minsum LGP Models 6. Duality and Sensitivity Analysis Formulation of the Multidimensional Dual A Numerical Example Interpretation of the Dual Variables Solving the Multidimensional Dual A Special MDD Simplex Algorithm Discrete Sensitivity Analysis Parametric LGP 7. Extensions Integer GP Nonlinear GP Interactive GP Notes References About the Author