IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-0-387-09707-7_13.html
   My bibliography  Save this book chapter

A Structure Conveying Parallelizable Modeling Language for Mathematical Programming

In: Parallel Scientific Computing and Optimization

Author

Listed:
  • Andreas Grothey

    (University of Edinburgh)

  • Jonathan Hogg

    (University of Edinburgh)

  • Kristian Woodsend

    (University of Edinburgh)

  • Marco Colombo

    (University of Edinburgh)

  • Jacek Gondzio

    (University of Edinburgh)

Abstract

Modeling languages are an important tool for the formulation of mathematical programming problems. Many real-life mathematical programming problems are of sizes that make their solution by parallel techniques the only viable option. Increasingly, even their generation by a modeling language cannot be achieved on a single processor. Surprisingly, however, there has been no effort so far at the development of a parallelizable modeling language. We present a modeling language that enables the modular formulation of optimization problems. Apart from often being more natural for the modeler, this enables the parallelization of the problem generation process making the modeling and solution of truly large problems feasible. The proposed structured modeling language is based on the popular modeling language AMPL and implemented as a pre-/postprocessor to AMPL. Unlike traditional modeling languages, it does not scramble the block-structure of the problem but passes this on to the solver if wished. Solvers such as block linear algebra exploiting interior point solvers Grothey_GG-almqp,Grothey_Steinb:Hierarchy,Grothey_BL-Riccati1) and decomposition solvers can therefore directly exploit the structure of the problem.

Suggested Citation

  • Andreas Grothey & Jonathan Hogg & Kristian Woodsend & Marco Colombo & Jacek Gondzio, 2009. "A Structure Conveying Parallelizable Modeling Language for Mathematical Programming," Springer Optimization and Its Applications, in: Parallel Scientific Computing and Optimization, pages 145-156, Springer.
    • Handle: RePEc:spr:spochp:978-0-387-09707-7_13
    DOI: 10.1007/978-0-387-09707-7_13
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:spochp:978-0-387-09707-7_13. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.