Linear and Nonlinear Programming

Authors:

ISBN: 978-3-319-18841-6 (Print) 978-3-319-18842-3 (Online)

Table of contents (15 chapters)

  1. Front Matter

    Pages i-xiii

  2. No Access

    Chapter

    Pages 1-8

    Introduction

  3. Linear Programming

    1. Front Matter

      Pages 9-9

    2. No Access

      Chapter

      Pages 11-31

      Basic Properties of Linear Programs

    3. No Access

      Chapter

      Pages 33-82

      The Simplex Method

    4. No Access

      Chapter

      Pages 83-114

      Duality and Complementarity

    5. No Access

      Chapter

      Pages 115-147

      Interior-Point Methods

    6. No Access

      Chapter

      Pages 149-176

      Conic Linear Programming

  4. Unconstrained Problems

    1. Front Matter

      Pages 177-177

    2. No Access

      Chapter

      Pages 179-211

      Basic Properties of Solutions and Algorithms

    3. No Access

      Chapter

      Pages 213-262

      Basic Descent Methods

    4. No Access

      Chapter

      Pages 263-284

      Conjugate Direction Methods

    5. No Access

      Chapter

      Pages 285-317

      Quasi-Newton Methods

  5. Constrained Minimization

    1. Front Matter

      Pages 319-319

    2. No Access

      Chapter

      Pages 321-355

      Constrained Minimization Conditions

    3. No Access

      Chapter

      Pages 357-396

      Primal Methods

    4. No Access

      Chapter

      Pages 397-428

      Penalty and Barrier Methods

    5. No Access

      Chapter

      Pages 429-465

      Duality and Dual Methods

    6. No Access

      Chapter

      Pages 467-494

      Primal-Dual Methods

  6. Back Matter

    Pages 495-546