menu
{ "item_title" : "Constrained Global Optimization", "item_author" : [" Panos M. Pardalos", "J. Ben Rosen "], "item_description" : "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).", "item_img_path" : "https://covers4.booksamillion.com/covers/bam/3/54/018/095/3540180958_b.jpg", "price_data" : { "retail_price" : "54.99", "online_price" : "54.99", "our_price" : "54.99", "club_price" : "54.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Constrained Global Optimization|Panos M. Pardalos

Constrained Global Optimization : Algorithms and Applications

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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).

This item is Non-Returnable

    1

Details

  • ISBN-13: 9783540180951
  • ISBN-10: 3540180958
  • Publisher: Springer
  • Publish Date: July 1987
  • Dimensions: 9.21 x 6.14 x 0.33 inches
  • Shipping Weight: 0.5 pounds
  • Page Count: 143

Related Categories

You May Also Like...

BAM Customer Reviews