9783540180951 - Constrained Global Optimization: Algorithms and Applications: Algorithms And Applications (Lecture Notes In Computer Science): 268 de Pardalos, Panos M. (12 resultados)

Condición: New. In.

Condición: New. pp. 156.

PF. Condición: New.

Paperback. Condición: Brand New. 1987 edition. 156 pages. 9.25x6.10x0.36 inches. In Stock.

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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).

Taschenbuch. Condición: Neu. Constrained Global Optimization: Algorithms and Applications | Panos M. Pardalos (u. a.) | Taschenbuch | ix | Englisch | 1987 | Springer | EAN 9783540180951 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Condición: Gut. Zustand: Gut | Sprache: Englisch | Produktart: Bücher | 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).

Condición: New. Print on Demand pp. 156 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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). 156 pp. Englisch.

Condición: New. PRINT ON DEMAND pp. 156.

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 application.

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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).Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 156 pp. Englisch.