Hierarchical Optimization and Mathematical Physics (Hardcover, 2000 ed.)


This book should be considered as an introduction to a special dass of hierarchical systems of optimal control, where subsystems are described by partial differential equations of various types. Optimization is carried out by means of a two-level scheme, where the center optimizes coordination for the upper level and subsystems find the optimal solutions for independent local problems. The main algorithm is a method of iterative aggregation. The coordinator solves the problern with macrovariables, whose number is less than the number of initial variables. This problern is often very simple. On the lower level, we have the usual optimal control problems of math ematical physics, which are far simpler than the initial statements. Thus, the decomposition (or reduction to problems ofless dimensions) is obtained. The algorithm constructs a sequence of so-called disaggregated solutions that are feasible for the main problern and converge to its optimal solutionunder certain assumptions ( e.g., under strict convexity of the input functions). Thus, we bridge the gap between two disciplines: optimization theory of large-scale systems and mathematical physics. The first motivation was a special model of branch planning, where the final product obeys a preset assortment relation. The ratio coefficient is maximized. Constraints are given in the form of linear inequalities with block diagonal structure of the part of a matrix that corresponds to subsystems. The central coordinator assem bles the final production from the components produced by the subsystems."

R3,031

Or split into 4x interest-free payments of 25% on orders over R50
Learn more

Discovery Miles30310
Mobicred@R284pm x 12* Mobicred Info
Free Delivery
Delivery AdviceShips in 15 - 20 working days


Toggle WishListAdd to wish list
Review this Item

Product Description

This book should be considered as an introduction to a special dass of hierarchical systems of optimal control, where subsystems are described by partial differential equations of various types. Optimization is carried out by means of a two-level scheme, where the center optimizes coordination for the upper level and subsystems find the optimal solutions for independent local problems. The main algorithm is a method of iterative aggregation. The coordinator solves the problern with macrovariables, whose number is less than the number of initial variables. This problern is often very simple. On the lower level, we have the usual optimal control problems of math ematical physics, which are far simpler than the initial statements. Thus, the decomposition (or reduction to problems ofless dimensions) is obtained. The algorithm constructs a sequence of so-called disaggregated solutions that are feasible for the main problern and converge to its optimal solutionunder certain assumptions ( e.g., under strict convexity of the input functions). Thus, we bridge the gap between two disciplines: optimization theory of large-scale systems and mathematical physics. The first motivation was a special model of branch planning, where the final product obeys a preset assortment relation. The ratio coefficient is maximized. Constraints are given in the form of linear inequalities with block diagonal structure of the part of a matrix that corresponds to subsystems. The central coordinator assem bles the final production from the components produced by the subsystems."

Customer Reviews

No reviews or ratings yet - be the first to create one!

Product Details

General

Imprint

Springer

Country of origin

Netherlands

Series

Applied Optimization, 37

Release date

2000

Availability

Expected to ship within 15 - 20 working days

First published

2000

Authors

Dimensions

235 x 155 x 19mm (L x W x T)

Format

Hardcover

Pages

310

Edition

2000 ed.

ISBN-13

978-0-7923-6175-6

Barcode

9780792361756

Categories

LSN

0-7923-6175-X



Trending On Loot