A parallel algorithm for constrained concave quadratic global minimization
AT Phillips, JB Rosen - Mathematical Programming, 1988 - Springer
The global minimization of large-scale concave quadratic problems over a bounded
polyhedral set using a parallel branch and bound approach is considered. The objective
function consists of both a concave part (nonlinear variables) and a strictly linear part, which
are coupled by the linear constraints. These large-scale problems are characterized by
having the number of linear variables much greater than the number of nonlinear variables.
A linear underestimating function to the concave part of the objective is easily constructed …
polyhedral set using a parallel branch and bound approach is considered. The objective
function consists of both a concave part (nonlinear variables) and a strictly linear part, which
are coupled by the linear constraints. These large-scale problems are characterized by
having the number of linear variables much greater than the number of nonlinear variables.
A linear underestimating function to the concave part of the objective is easily constructed …
[CITATION][C] A parallel algorithm for constrained concave quadratic global minimization: Computational aspects
AT Phillips, JB Rosen - 1987 - University of Minnesota …
Showing the best results for this search. See all results