Lingua: Inglese
Editore: Berlin / Heidelberg, Springer, 1987
ISBN 10: 3540180958 ISBN 13: 9783540180951
Da: Antiquariat Thomas Haker GmbH & Co. KG, Berlin, Germania
Membro dell'associazione: GIAQ
EUR 8,90
Quantità: 1 disponibili
Aggiungi al carrellobrosch. Condizione: Gut. Auflage: 1987. 143 S., numerous figures, Guter Zustand / good condition. Slightly brownished paper. Sprache: Englisch Gewicht in Gramm: 465.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 58,64
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: Chiron Media, Wallingford, Regno Unito
EUR 56,41
Quantità: 10 disponibili
Aggiungi al carrelloPF. Condizione: New.
Condizione: New. pp. 156.
Da: Revaluation Books, Exeter, Regno Unito
EUR 76,20
Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 1987 edition. 156 pages. 9.25x6.10x0.36 inches. In Stock.
EUR 58,39
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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).
EUR 50,25
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
EUR 23,79
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: 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).
Lingua: Inglese
Editore: Springer, Springer Berlin Heidelberg Jul 1987, 1987
ISBN 10: 3540180958 ISBN 13: 9783540180951
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 53,49
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
Da: Majestic Books, Hounslow, Regno Unito
EUR 75,80
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: 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.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 76,98
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND pp. 156.
Lingua: Inglese
Editore: Springer Berlin Heidelberg, 1987
ISBN 10: 3540180958 ISBN 13: 9783540180951
Da: moluna, Greven, Germania
EUR 48,37
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: 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.
Lingua: Inglese
Editore: Springer, Springer Jul 1987, 1987
ISBN 10: 3540180958 ISBN 13: 9783540180951
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 53,49
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.