What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
Constrained Global Optimization: Algorithms and Applications
Panos M. Pardalos,J. Ben Rosen
No preview available - 1987
algorithm applications approach approximate assume bilinear branch and bound Chapter computational concave function concave quadratic cone Consider constraints construct contains convergence convex envelope convex function convex set corresponding cutting plane defined denote described equivalent error example extreme points Falk feasible domain finite formulated function f given gives global minimum global optimization global solution indefinite quadratic integer large scale linear function linear program lower bound Math matrix method nonconvex programming nonlinear programming Note objective function obtain Oper optimization problems optimum ordered partition piecewise linear polyhedron polytope procedure Progr programming problem Proof proposed prove quadratic problem quadratic programming ranking rectangle References Report separable sequence simplex solution solving step symmetric matrix techniques test problems Theorem tion underestimating function Univ upper bounds variables vector vertex vertices zero-one χεΡ