Solving large MINLPs on computational grids

We consider the solution of Mixed Integer Nonlinear Programming (MINLP) problems by a parallel implementation of nonlinear branch-and-bound on a computational grid or meta-computer. Computational experience on a set of large MINLPs is reported which indicates that this approach is efficient for the solution of large MINLPs.

Citation

Numerical Analysis Report NA/200, Department of Mathematics, University of Dundee, DD1 4HN, U.K.

Article

Download

View Solving large MINLPs on computational grids