Solving Large MINLPs on Computational Grids

Authors: Goux J.-P.1; Leyffer S.2

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

Publisher: Springer

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content

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

The full text electronic article is available for purchase. You will be able to download the full text electronic article after payment.

$47.00 plus tax      Refund Policy

 

OR

Back to top

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages.
Page Help Click here for Page Help
Shopping cart
Tools
Sign in






Need to register?
Sign up here
Text size: A | A | A | A