Artículos relacionados a Constrained Global Optimization: Algorithms and Applications...

Constrained Global Optimization: Algorithms and Applications: Algorithms And Applications (Lecture Notes In Computer Science): 268 - Tapa blanda

Pardalos, Panos M.

 
9783540180951: Constrained Global Optimization: Algorithms and Applications: Algorithms And Applications (Lecture Notes In Computer Science): 268
Tapa blanda
ISBN 10: 3540180958 ISBN 13: 9783540180951
Editorial: Springer, 1987

Sinopsis

Global optimization is concerned with the characterization and computation of global minima or maxima of nonlinear functions. Such problems are widespread in mathematical modeling of real world systems for a very broad range of applications. The applications include economies of scale, fixed charges, allocation and location problems, quadratic assignment and a number of other combinatorial optimization problems. More recently it has been shown that certain aspects of VLSI chip design and database problems can be formulated as constrained global optimization problems with a quadratic objective function. Although standard nonlinear programming algorithms will usually obtain a local minimum to the problem , such a local minimum will only be global when certain conditions are satisfied (such as f and K being convex).

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

Global optimization is concerned with the characterization and computation of global minima or maxima of nonlinear functions. Such problems are widespread in mathematical modeling of real world systems for a very broad range of applications. The applications include economies of scale, fixed charges, allocation and location problems, quadratic assignment and a number of other combinatorial optimization problems. More recently it has been shown that certain aspects of VLSI chip design and database problems can be formulated as constrained global optimization problems with a quadratic objective function. Although standard nonlinear programming algorithms will usually obtain a local minimum to the problem , such a local minimum will only be global when certain conditions are satisfied (such as f and K being convex).

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Springer
Año de publicación
1987
Idioma
Inglés
ISBN 10 
3540180958
ISBN 13 
9783540180951
Encuadernación
Tapa blanda
Número de páginas
156
Contacto del fabricante
GPSR Kontakt
ProductSafety@springernature.com

Abraham-Lincoln-Str. 46
Wiesbaden
65189
Alemania

Otras ediciones populares con el mismo título

9780387180953: Constrained Global Optimization: Algorithms and Applications (Lecture Notes in Computer Science)

Edición Destacada

ISBN 10:  0387180958 ISBN 13:  9780387180953
Tapa blanda