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.
"Sinopsis" puede pertenecer a otra edición de este libro.
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: New Book Sale, London, Reino Unido
Hardcover. Condición: New. Usually Dispatched within 1-2 Business Days , Buy with confidence , excellent customer service. Nº de ref. del artículo: 0792368177--97
Cantidad disponible: 1 disponibles
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Condición: New. Nº de ref. del artículo: ABLIING23Feb2416190184021
Cantidad disponible: Más de 20 disponibles
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Condición: New. In. Nº de ref. del artículo: ria9780792368175_new
Cantidad disponible: Más de 20 disponibles
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Buch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 328 pp. Englisch. Nº de ref. del artículo: 9780792368175
Cantidad disponible: 2 disponibles
Librería: moluna, Greven, Alemania
Gebunden. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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. Nº de ref. del artículo: 5969705
Cantidad disponible: Más de 20 disponibles
Librería: preigu, Osnabrück, Alemania
Buch. Condición: Neu. Large-scale Optimization | Problems and Methods | Vladimir Tsurkov | Buch | Einband - fest (Hardcover) | Englisch | 2001 | Springer US | EAN 9780792368175 | Verantwortliche Person für die EU: Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, productsafety[at]springernature[dot]com | Anbieter: preigu Print on Demand. Nº de ref. del artículo: 102549832
Cantidad disponible: 5 disponibles
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Condición: New. Analyzes the issues of loss of accuracy, recovery of original variables (disaggregation), and compatibility conditions. This book also analyzes the method of iterative aggregation in large-scale problems. For fixed weights, it solves simpler aggregated problems. Series: Applied Optimization. Num Pages: 324 pages, biography. BIC Classification: GPFC; PBW; UM. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 235 x 155 x 19. Weight in Grams: 636. . 2001. Hardback. . . . . Nº de ref. del artículo: V9780792368175
Cantidad disponible: 15 disponibles
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Buch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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. 328 pp. Englisch. Nº de ref. del artículo: 9780792368175
Cantidad disponible: 1 disponibles
Librería: Mispah books, Redhill, SURRE, Reino Unido
Hardcover. Condición: Like New. Like New. book. Nº de ref. del artículo: ERICA77307923681776
Cantidad disponible: 1 disponibles
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Buch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Nº de ref. del artículo: 9780792368175
Cantidad disponible: 1 disponibles