ISSN:
1436-4646
Keywords:
Global Minimization
;
Linear Constraints
;
Quadratic Concave Function
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract A method is presented for the construction of test problems for which the global minimum point is known. Given a bounded convex polyhedron inR n , and a selected vertex, a concave quadratic function is constructed which attains its global minimum at the selected vertex. In general, this function will also have many other local minima.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01585116
Permalink