Solving Large MINLPs on Computational Grids

Authors: Goux J.-P.¹; Leyffer S.²

Source: Optimization and Engineering, Volume 3, Number 3, September 2002 , pp. 327-346(20)

Publisher: Springer

Abstract:

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 these problems.

Keywords: mixed integer nonlinear programming; parallel branch-and-bound; computational grid; metacomputing

Language: English

Document Type: Research article

Affiliations: 1: Artelys, 215 rue Jean-Jacques Rousseau, 92136 Issy-les-Moulineaux Cedex, France. jean-pierre.goux@artelys.com 2: MCS Division, Argonne National Laboratory, 9700 South Cass Avenue, Argonne, IL 60439, USA. leyffer@mcs.anl.gov

Publication date: 2002-09-01

• In this: publication
• By this: publisher
• In this Subject: General & Civil Engineering ,  Materials & Manufacturing ,  Mathematics and Statistics ,  Industrial Engineering
• By this author: Goux J.-P. ;  Leyffer S.

Website © Publishing Technology. Article copyright remains with the publisher, society or author(s) as specified within the article.

• Terms and conditions
• Privacy policy
• Information for advertisers