Large-scale Optimization

Problems and Methods

By: Vladimir Tsurkov

Write A Review

eText | 9 March 2013

At a Glance

Format
PDF

eText

$239.00

or 4 interest-free payments of $59.75 with

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.

Decomposition methods aim to reduce large-scale problems to simpler problems. This monograph presents selected aspects of the dimension-reduction problem. Exact and approximate aggregations of multidimensional systems are developed and from a known model of input-output balance, aggregation methods are categorized. The issues of loss of accuracy, recovery of original variables (disaggregation), and compatibility conditions are analyzed in detail. The method of iterative aggregation in large-scale problems is studied. For fixed weights, successively simpler aggregated problems are solved and the convergence of their solution to that of the original problem is analyzed. An introduction to block integer programming is considered. Duality theory, which is widely used in continuous block programming, does not work for the integer problem. A survey of alternative methods is presented and special attention is given to combined methods of decomposition. Block problems in which the coupling variables do not enter the binding constraints are studied. These models are worthwhile because they permit a decomposition with respect to primal and dual variables by two-level algorithms instead of three-level algorithms. Audience: This book is addressed to specialists in operations research, optimization, and optimal control.