Linear Programming Survey
Table 10
| Product | Algorithms/Methods | ||||
| Simplex | Interior Point | Branch-and-Cut | Local Search | Other Algorithms/Methods: | |
| AIMMS | y | y | y | y | Constraint Programming, Robust Counterpart, Stochastoc Programming, Benders Decomposition, Outer Approximation |
| AMPL | y | y | y | y | constraint programming, global optimization |
| AMPL API | |||||
| AMPLDev | |||||
| Analytic Solver | y | y | y | y | 12 Options: GRG, SQP, Interval, Genetic Algorithms, Tabu/Scatter Search, Other |
| Analytica Optimizer | y | y | y | evolutionary (genetic), Monte Carlo uncertainty analysis, intelligent arrays. | |
| AnalyticSolver.com | y | y | y | y | 12 Options: GRG, SQP, Interval, Genetic Algorithms, Tabu/Scatter Search, Other |
| Artelys Knitro | y | y | y | y | Nonlinear programming algorithms, Active Set, Sequential Quadratic Programming, Quesada-Grossmann, MISQP |
| Bonmin | y | outer approximation | |||
| Bonmin | y | ||||
| Cbc (COIN-OR Branch and Cut) | y | ||||
| Clp (COIN-OR LP Solver) | y | y | |||
| CMPL (<Coliop|Coin> Mathematical Programming Language) | y | y | y | solver depending | |
| CoinMP Open-Source Solver | y | y | y | y | Heuristic Search |
| Couenne | y | ||||
| Dip (Decomposition in Inteeger Programming) | y | ||||
| Dippy | y | y | |||
| FICO® Xpress Optimization Suite | y | y | y | Constraint programming, robust optimization, sensitivity analysis, heuristics | |
| FortSP | y | Level decomposition | |||
| GAMS | y | y | y | ||
| GCG | y | Branch-and-Price, automatic Dantzig-Wolfe reformulation | |||
| GENO 2.0 | Evolutionary Algorithm | ||||
| GIPALS32 | y | ||||
| GLPK (GNU Linear Programming Kit) | y | y | y | LP/MIP preprocessing, MIP heuristics, transforming MIP to CNF-SAT | |
| hsol | y | ||||
| IBM Decision Optimization on Cloud | y | y | y | edge-finder, alldifferent, other propagation algorithms | |
| IBM ILOG CPLEX Optimization Studio | y | y | y | y | edge-finder, alldifferent, other propagation algorithms |
| IBM Decision Optimization Center | y | y | y | y | edge-finder, alldifferent, other propagation algorithms |
| Ipopt | y | ||||
| JuMP | |||||
| LINDO API | y | y | y | y | SOC, SDP, GRG, Global, Benders Extensive heuristics to give good initial solutions fast. |
| LINGO | y | y | y | y | SOC, SDP, GRG, Global, Benders. Extensive heuristics to give good initial solutions fast. |
| LocalSolver | y | y | y | constraint propagation & inference techniques, nonlinear programming techniques. | |
| LOQO | y | ||||
| LPL Modeling System | |||||
| MATLAB and Optimization Toolbox | y | y | y | Sequential quadratic programming, trust region, Levenberg-Marquardt, Nelder-Mead | |
| MibS (Mixed Integer Bilevel Solver) | y | ||||
| MOSEK Optimization Suite | y | y | y | ||
| MPL Modeling System | y | y | y | y | Heuristics Search, Infeasibility Diagnosis, Stochastic Programming |
| OMP Plus | y | y | y | y | |
| OpenSolver | y | y | y | ||
| OpenSolver for Google Sheets | y | y | |||
| OptiMax Component Library | y | y | y | y | Heuristics Search, Infeasibility Diagnosis, Stochastic Programming |
| ParaSCIP, FiberSCIP | y | ||||
| Pulp | |||||
| Pyomo | |||||
| RASON: Restful Analytic Solver Object Notation | y | y | y | y | 12 Options: GRG, SQP, Interval, Genetic Algorithms, Tabu/Scatter Search, Other |
| SAS Optimization 8.1 | y | y | y | y | Automated Dantzig-Wolfe decomposition; network optimization algorithms. |
| SAS/OR 14.2 | y | y | y | y | automated Dantzig-Wolfe decomposition; network optimization; constraint programming |
| SCIP | y | y | column generation, branch-and-price, solution counting | ||
| Solver for Excel Online and Google Sheets | y | y | y | y | GRG Nonlinear, Genetic Algorithms, Tabu/Scatter Search |
| Solver SDK | y | y | y | y | 12 Options: GRG, SQP, Interval, Genetic Algorithms, Tabu/Scatter Search, Other |
| SolverStudio | y | y | y | ||
| SoPlex | y | scaling, row basis, iterative refinement, LP solution polishing, exact solving | |||
| SYMPHONY | y | ||||
| The Gurobi Optimizer | y | y | y | y | presolve, sifting, feasrelax, sensitivity analysis, infeasibility analysis |
| UG: FiberSCIP and ParaSCIP | y | Presolve, Primal Heuristics, Conflict Analysis | |||
| Vanguard System | y | y | Proprietary algorithms/methods | ||
| What'sBest! | y | y | y | y | SOC, SDP, GRG, Global, Benders. Extensive heuristics to give good initial solutions fast. |
| XA Professional Linear Programming System | y | y | y | ||
| ZIMPL | |||||
Linear Programming Software Survey Pages:
Introduction | Page 1 | Page 2 | Page 3 | Page 4 | Page 5 | Page 6| Page 7 | Page 8| Page 9 | Page 10 | Page 11 | Page 12 | Page 13 | Vendor List | Accompanying Article