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).
"synopsis" may belong to another edition of this title.
US$ 6.99 shipping within U.S.A.
Destination, rates & speedsSeller: GuthrieBooks, Spring Branch, TX, U.S.A.
Paperback. Condition: Very Good. We are unable to ship to Canada at this time.Ex-library paperback in very nice condition with the usual markings and attachments. Seller Inventory # DA1411888
Quantity: 1 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 21286303-n
Quantity: 15 available
Seller: Best Price, Torrance, CA, U.S.A.
Condition: New. SUPER FAST SHIPPING. Seller Inventory # 9783540180951
Quantity: 2 available
Seller: Grand Eagle Retail, Mason, OH, U.S.A.
Paperback. Condition: new. Paperback. 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). Global optimization is concerned with the characterization and computation of global minima or maxima of nonlinear functions. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9783540180951
Quantity: 1 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition. Seller Inventory # 21286303
Quantity: 15 available
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9783540180951
Quantity: Over 20 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9783540180951_new
Quantity: Over 20 available
Seller: Chiron Media, Wallingford, United Kingdom
PF. Condition: New. Seller Inventory # 6666-IUK-9783540180951
Quantity: 10 available
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 156. Seller Inventory # 26101342963
Quantity: 4 available
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Taschenbuch. Condition: 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. Seller Inventory # 9783540180951
Quantity: 2 available