Linear and Nonlinear Programming

Authors:

ISBN: 978-0-387-74502-2 (Print) 978-0-387-74503-9 (Online)

Table of contents (15 chapters)

  1. Front Matter

    Pages I-XIII

  2. Introduction

    1. Front Matter

      Pages 1-1

    2. No Access

      Chapter

      Pages 1-7

      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-78

      The Simplex Method

    4. No Access

      Chapter

      Pages 79-110

      Duality

    5. No Access

      Chapter

      Pages 111-143

      Interior-Point Methods

    6. No Access

      Chapter

      Pages 145-179

      Transportation and Network Flow Problems

  4. Unconstrained Problems

    1. Front Matter

      Pages 181-181

    2. No Access

      Chapter

      Pages 183-214

      Basic Properties of Solutions and Algorithms

    3. No Access

      Chapter

      Pages 215-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-357

      Constrained Minimization Conditions

    3. No Access

      Chapter

      Pages 359-400

      Primal Methods

    4. No Access

      Chapter

      Pages 401-433

      Penalty and Barrier Methods

    5. No Access

      Chapter

      Pages 435-468

      Dual and Cutting Plane Methods

    6. No Access

      Chapter

      Pages 469-505

      Primal-Dual Methods

  6. Back Matter

    Pages 507-546