z-logo
open-access-imgOpen Access
Comparison of open-source linear programming solvers.
Author(s) -
Jared Gearhart,
Kristin Adair,
Justin Durfee,
Katherine Jones,
Nathaniel G. Martin,
Richard Detry
Publication year - 2013
Language(s) - English
Resource type - Reports
DOI - 10.2172/1104761
Subject(s) - solver , linear programming , computer science , software , ibm , modular design , open source , mathematical optimization , minos , mathematics , algorithm , programming language , materials science , physics , nuclear physics , neutrino , nanotechnology , neutrino oscillation
When developing linear programming models, issues such as budget limitations, customer requirements, or licensing may preclude the use of commercial linear programming solvers. In such cases, one option is to use an open-source linear programming solver. A survey of linear programming tools was conducted to identify potential open-source solvers. From this survey, four open-source solvers were tested using a collection of linear programming test problems and the results were compared to IBM ILOG CPLEX Optimizer (CPLEX) [1], an industry standard. The solvers considered were: COIN-OR Linear Programming (CLP) [2], [3], GNU Linear Programming Kit (GLPK) [4], lp_solve [5] and Modular In-core Nonlinear Optimization System (MINOS) [6]. As no open-source solver outperforms CPLEX, this study demonstrates the power of commercial linear programming software. CLP was found to be the top performing open-source solver considered in terms of capability and speed. GLPK also performed well but cannot match the speed of CLP or CPLEX. lp_solve and MINOS were considerably slower and encountered issues when solving several test problems.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom