Welcome to P K Kelkar Library, Online Public Access Catalogue (OPAC)

Normal view MARC view ISBD view

Decomposition Techniques in Mathematical Programming : Engineering and Science Applications /

By: Conejo, Antonio J [author.].
Contributor(s): Castillo, Enrique [author.1 ] | M�nguez, Roberto [author.1 ] | [author.2 ] | .
Material type: materialTypeLabelBookBerlin, Heidelberg : Springer Berlin Heidelberg, 2006. Description: XVI, 542 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540276869.Subject(s): Engineering. 0 | Operations research. 0 | Decision making. 0 | Applied mathematics. 0 | Engineering mathematics. 0 | Management science.14 | Engineering.24 | Appl.Mathematics/Computational Methods of Engineering.24 | Operations Research, Management Science.24 | Operation Research/Decision Theory.24 | Applications of Mathematics.1DDC classification: 519 Online resources: Click here to access online
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: Summary: 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. 0
    average rating: 0.0 (0 votes)
Item type Current location Call number Status Date due Barcode Item holds
PK Kelkar Library, IIT Kanpur
Available EBKS0008973
Total holds: 0

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. 0

There are no comments for this item.

Log in to your account to post a comment.

Powered by Koha