Contents:
       Preface
    1. Introduction
        PART I. Linear Programming
    2. Basic Properties of Linear Programs
    3. The Simplex Method
    4. Duality
    5. Reduction of Linear Inequalities
        PART II. Unconstrained Problems
    6. Basic Properties of  Solutions and Algorithms
    7. Basic Descent Methods
    8. Conjugate Direction Methods
    9. Quasi-Newton Methods
        PART III. Constrained Minimization
   10. Constrained Minimization Conditions
   11. Primal Methods
   12. Penalty and Barrier Methods
   13. Cutting Plane and Dual Methods
         Appendix A. Mathematical Review
         Appendix B. Convex Sets
         Appendix C. Gaussian Elimination
         Bibliography
         Index