2006

Decomposition Techniques in Mathematical Programming

Engineering and Science Applications

ISBN: 978-3-540-27685-2 (Print) 978-3-540-27686-9 (Online)

Table of contents (11 chapters)

  1. Motivation and Introduction

    1. Front Matter

      Pages 1-1

    2. No Access

      Book Chapter

      Pages 3-64

      Motivating Examples: Models with Decomposable Structure

  2. Decomposition Techniques

    1. Front Matter

      Pages 65-65

    2. No Access

      Book Chapter

      Pages 67-106

      Decomposition in Linear Programming: Complicating Constraints

    3. No Access

      Book Chapter

      Pages 107-139

      Decomposition in Linear Programming: Complicating Variables

    4. No Access

      Book Chapter

      Pages 141-185

      Duality

    5. No Access

      Book Chapter

      Pages 187-242

      Decomposition in Nonlinear Programming

    6. No Access

      Book Chapter

      Pages 243-270

      Decomposition in Mixed-Integer Programming

    7. No Access

      Book Chapter

      Pages 271-299

      Other Decomposition Techniques

  3. Local Sensitivity Analysis

    1. Front Matter

      Pages 301-301

    2. No Access

      Book Chapter

      Pages 303-346

      Local Sensitivity Analysis

  4. Applications

    1. Front Matter

      Pages 347-347

    2. No Access

      Book Chapter

      Pages 349-393

      Applications

  5. Computer Codes

    1. Front Matter

      Pages 395-395

    2. No Access

      Book Chapter

      Pages 397-417

      Some GAMS Implementations

  6. Solution to Selected Exercises

    1. Front Matter

      Pages 419-419

    2. No Access

      Book Chapter

      Pages 421-529

      Exercise Solutions