Amazon cover image
Image from Amazon.com

Decomposition Techniques in Mathematical Programming [electronic resource] : Engineering and Science Applications / by Antonio J. Conejo, Enrique Castillo, Roberto Mínguez, Raquel García-Bertrand.

By: Contributor(s): Material type: TextTextPublisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2006Description: XVI, 542 p. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540276869
Subject(s): Additional physical formats: Printed edition:: No titleDDC classification:
  • 519 23
LOC classification:
  • TA329-348
  • TA640-643
Online resources:
Contents:
Motivation and Introduction -- Motivating Examples: Models with Decomposable Structure -- Decomposition Techniques -- Decomposition in Linear Programming: Complicating Constraints -- Decomposition in Linear Programming: Complicating Variables -- Duality -- Decomposition in Nonlinear Programming -- Decomposition in Mixed-Integer Programming -- Other Decomposition Techniques -- Local Sensitivity Analysis -- Local Sensitivity Analysis -- Applications -- Applications -- Computer Codes -- Some GAMS Implementations -- Solution to Selected Exercises -- Exercise Solutions.
In: Springer eBooksSummary: This textbook for students and practitioners presents a practical approach to decomposition techniques in optimization. It provides an appropriate blend of theoretical background and practical applications in engineering and science, which makes the book interesting for practitioners, as well as engineering, operations research and applied economics graduate and postgraduate students. "Decomposition Techniques in Mathematical Programming" is based on clarifying, illustrative and computational examples and applications from electrical, mechanical, energy and civil engineering as well as applied mathematics and economics. It addresses decomposition in linear programming, mixed-integer linear programming, nonlinear programming, and mixed-integer nonlinear programming, and provides rigorous decomposition algorithms as well as heuristic ones. Practical applications are developed up to working algorithms that can be readily used. The theoretical background of the book is deep enough to be of interest to applied mathematicians. It includes end of chapter exercises and the solutions to the even numbered exercises are included as an appendix.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Status Date due Barcode
E-Book E-Book Central Library Available E-42425

Motivation and Introduction -- Motivating Examples: Models with Decomposable Structure -- Decomposition Techniques -- Decomposition in Linear Programming: Complicating Constraints -- Decomposition in Linear Programming: Complicating Variables -- Duality -- Decomposition in Nonlinear Programming -- Decomposition in Mixed-Integer Programming -- Other Decomposition Techniques -- Local Sensitivity Analysis -- Local Sensitivity Analysis -- Applications -- Applications -- Computer Codes -- Some GAMS Implementations -- Solution to Selected Exercises -- Exercise Solutions.

This textbook for students and practitioners presents a practical approach to decomposition techniques in optimization. It provides an appropriate blend of theoretical background and practical applications in engineering and science, which makes the book interesting for practitioners, as well as engineering, operations research and applied economics graduate and postgraduate students. "Decomposition Techniques in Mathematical Programming" is based on clarifying, illustrative and computational examples and applications from electrical, mechanical, energy and civil engineering as well as applied mathematics and economics. It addresses decomposition in linear programming, mixed-integer linear programming, nonlinear programming, and mixed-integer nonlinear programming, and provides rigorous decomposition algorithms as well as heuristic ones. Practical applications are developed up to working algorithms that can be readily used. The theoretical background of the book is deep enough to be of interest to applied mathematicians. It includes end of chapter exercises and the solutions to the even numbered exercises are included as an appendix.

There are no comments on this title.

to post a comment.

Maintained by VTU Library