 |
| Developer(s) | IBM |
|---|---|
| Stable release | 20.1.0 [1] |
| Type | Technical computing |
| License | Proprietary |
| Website | www |
IBM ILOG CPLEX Optimization Studio (often informally referred to simply as CPLEX) is an optimization software package.
| |
| Developer(s) | IBM |
|---|---|
| Stable release | 20.1.0 [1] |
| Type | Technical computing |
| License | Proprietary |
| Website | www |
IBM ILOG CPLEX Optimization Studio (often informally referred to simply as CPLEX) is an optimization software package.
The CPLEX Optimizer was named after the simplex method implemented in the C programming language. However, today it also supports other types of mathematical optimization and offers interfaces other than C. It was originally developed by Robert E. Bixby and sold commercially in 1988 by CPLEX Optimization Inc. This was acquired by ILOG in 1997 and ILOG was subsequently acquired by IBM in January 2009. [2] CPLEX continues to be actively developed by IBM.
The IBM ILOG CPLEX Optimizer solves integer programming problems, very large [3] linear programming problems using either primal or dual variants of the simplex method or the barrier interior point method, convex and non-convex quadratic programming problems, and convex quadratically constrained problems (solved via second-order cone programming, or SOCP).
The CPLEX Optimizer has a modeling layer called Concert that provides interfaces to the C++, C#, and Java languages. There is a Python language interface based on the C interface. Finally, a stand-alone Interactive Optimizer executable is provided for debugging and other purposes.
The CPLEX Optimizer is accessible through independent modeling systems such as AIMMS, AMPL, GAMS, OptimJ and TOMLAB. In addition to that AMPL provides an interface to the CPLEX CP Optimizer.
The full IBM ILOG CPLEX Optimization Studio consists of the CPLEX Optimizer for mathematical programming, the CP Optimizer for constraint programming, [4] the Optimization Programming Language (OPL), and a tightly integrated IDE.
Prior to IBM acquiring ILOG, the CPLEX team published a release history of CPLEX. [5]
| Version | Release Date | Key Features |
|---|---|---|
| 22.1.1 | December, 2022 | Python 3.7 support dropped, new solver parameter added. [6] |
| 22.1.0 | March, 2022 | Python 3.9 and 3.10 support added, new solver parameters added. [7] |
| 20.1 | December, 2020 | MIP performance improvements, new 'emphasis MIP 5' mode, etc. [8] |
| 12.10 | December, 2019 | MIP performance improvements and the addition of a generic branching callback to the other generic callbacks introduced in version 12.8. |
| 12.9 | March, 2019 | Direct support for multiobjective optimization, callback functionality improvement. |
| 12.8 | December, 2017 | Generic callback, API recorder to facilitate debugging, subMIP control parameters, Download and Go offering. |
| 12.7 | November, 2016 | Automated Benders decomposition, modeling assistance tool, runseeds command to better assess performance variability. |
| 12.6.2 | June, 2015 | Performance improvements (mainly for SOCP, MISOCP, non-convex QP), support for cloud based optimization. |
| 12.6 | December, 2013 | Support for nonconvex QPs and MIQPs, distributed parallel MIP and more parallelism at the root node for MIPs.. |
| 12.5 | October, 2012 | MIP performance improvements, random seed parameter to address performance variability, remote object, duals for QCPs, deterministic tuning tool. |
| 12.4 | November, 2011 | Deterministic time limit support, duals for SOCPs, quadratic expression API in Concert, performance improvements across all algorithms, but especially MIP. |
| 12.3 | June, 2011 | Support for large nonzero counts that require 64 bit indexing, local optima for non-convex QP, and globalization. |
| 12.2 | June, 2010 | More parallelism at the root node, deterministic parallel concurrent LP optimization, along with some additional barrier performance improvements and additional tools for diagnosing ill conditioned basis matrices in MIPs. |
| 12.0 | April, 2009 | The first version after IBM acquired ILOG. Includes connectors for Python, MATLAB and Excel. Deterministic parallel barrier is also included. |
| 11.0 | October, 2007 | Breakthrough performance gains for mixed integer programming (MIP) models and enhanced parallel MIP optimization. The MIP solution pool feature and the performance tuning utility are introduced. |
| 10.0 | January, 2006 | Performance improvements in the primal simplex and barrier methods, as well as the MIP optimizer. Indicator constraints and solution polishing heuristics are introduced and improvements to infeasibility analysis are made. |
| 9.0 | December, 2003 | Performance improvements in primal and dual simplex methods and the MIP optimizer. It includes ILOG Concert Technology for .NET users and support for quadratically constrained programs. |
| 8.0 | July, 2002 | MIP performance improvements and support for mixed integer quadratic programs. |
| 7.5 | December, 2001 | ILOG Concert Technology for Java users. |
| 7.0 | October, 2000 | ILOG Concert Technology for C++ users. |
| 6.5 | March, 1999 | Significant performance improvements in primal and dual simplex methods, and ILOG CPLEX Mixed Integer Optimizer. |
| 6.0 | April, 1998 | Significant performance improvements in primal and dual simplex methods, and CPLEX Barrier Optimizer. |
| 5.0 | September, 1997 | New memory model for easy C++ integration. |
| 4.0.5 | March, 1996 | Parallel CPLEX Mixed Integer Solver is introduced. |
| 4.0 | December, 1995 | Redesigned advanced programming interface (API) to allow thread-safe applications. |
| 3.0.8 | March, 1995 | Parallel CPLEX Barrier Solver is introduced. |
| 3.0 | April, 1994 | CPLEX Barrier Solver is introduced. |
| 2.1 | March, 1993 | Introduction of CPLEX Presolve algorithms. |
| 2.0 | April, 1992 | Performance improvements. |
| 1.2 | 1991 | Support for the dual simplex method and CPLEX Mixed Integer Optimizer. |
| 1.0 | 1988 | Primal Simplex Method |
AMPL is an algebraic modeling language to describe and solve high-complexity problems for large-scale mathematical computing . It was developed by Robert Fourer, David Gay, and Brian Kernighan at Bell Laboratories. AMPL supports dozens of solvers, both open source and commercial software, including CBC, CPLEX, FortMP, MOSEK, MINOS, IPOPT, SNOPT, KNITRO, and LGO. Problems are passed to solvers as nl files. AMPL is used by more than 100 corporate clients, and by government agencies and academic institutions.
ECLiPSe is a software system for the development and deployment of constraint logic programming applications, e.g., in the areas of optimization, planning, scheduling, resource allocation, timetabling, transport, etc. It is also suited for teaching most aspects of combinatorial problem solving, e.g., problem modeling, constraint programming, mathematical programming, and search techniques. It contains constraint solver libraries, a high-level modeling and control language, interfaces to third-party solvers, an integrated development environment and interfaces for embedding into host environments.
The Galahad library is a thread-safe library of packages for the solution of mathematical optimization problems. The areas covered by the library are unconstrained and bound-constrained optimization, quadratic programming, nonlinear programming, systems of nonlinear equations and inequalities, and non-linear least squares problems. The library is mostly written in the Fortran 90 programming language.
Computational Infrastructure for Operations Research (COIN-OR), is a project that aims to "create for mathematical software what the open literature is for mathematical theory." The open literature provides the operations research (OR) community with a peer-review process and an archive. Papers in operations research journals on mathematical theory often contain supporting numerical results from computational studies. The software implementations, models, and data used to produce the numerical results are typically not published. The status quo impeded researchers needing to reproduce computational results, make fair comparisons, and extend the state of the art.
The TOMLAB Optimization Environment is a modeling platform for solving applied optimization problems in MATLAB.
Algebraic modeling languages (AML) are high-level computer programming languages for describing and solving high complexity problems for large scale mathematical computation. One particular advantage of some algebraic modeling languages like AIMMS, AMPL, GAMS, Gekko, MathProg, Mosel, and OPL is the similarity of their syntax to the mathematical notation of optimization problems. This allows for a very concise and readable definition of problems in the domain of optimization, which is supported by certain language elements like sets, indices, algebraic expressions, powerful sparse index and data handling variables, constraints with arbitrary names. The algebraic formulation of a model does not contain any hints how to process it.
ILOG S.A. was an international software company purchased and incorporated into IBM announced in January, 2009. It created enterprise software products for supply chain, business rule management, visualization and optimization. The main product line for Business Rules Management Systems (BRMS) has been rebranded as IBM Operational Decision Management. Many of the related components retain the ILOG brand as a part of their name.
The Zuse Institute Berlin is a research institute for applied mathematics and computer science on the campus of Freie Universität Berlin in Dahlem, Berlin, Germany.
MOSEK is a software package for the solution of linear, mixed-integer linear, quadratic, mixed-integer quadratic, quadratically constrained, conic and convex nonlinear mathematical optimization problems. The applicability of the solver varies widely and is commonly used for solving problems in areas such as engineering, finance and computer science.
WORHP, also referred to as eNLP by ESA, is a mathematical software library for numerically solving large scale continuous nonlinear optimization problems.
SAMPL, which stands for "Stochastic AMPL", is an algebraic modeling language resulting by expanding the well-known language AMPL with extended syntax and keywords. It is designed specifically for representing stochastic programming problems and, through recent extensions, problems with chance constraints, integrated chance constraints and robust optimization problems. It can generate the deterministic equivalent version of the instances, using all the solvers AMPL connects to, or generate an SMPS representation and use specialized decomposition based solvers, like FortSP.
The FICO Xpress optimizer is a commercial optimization solver for linear programming (LP), mixed integer linear programming (MILP), convex quadratic programming (QP), convex quadratically constrained quadratic programming (QCQP), second-order cone programming (SOCP) and their mixed integer counterparts. Xpress includes a general purpose nonlinear global solver, Xpress Global, and a nonlinear local solver, Xpress NonLinear, including a successive linear programming algorithm, and Artelys Knitro.
MINOS is a Fortran software package for solving linear and nonlinear mathematical optimization problems. MINOS may be used for linear programming, quadratic programming, and more general objective functions and constraints, and for finding a feasible point for a set of linear or nonlinear equalities and inequalities.
Pyomo is a collection of Python software packages for formulating optimization models.
Convex Over and Under ENvelopes for Nonlinear Estimation (Couenne) is an open-source library for solving global optimization problems, also termed mixed integer nonlinear optimization problems. A global optimization problem requires to minimize a function, called objective function, subject to a set of constraints. Both the objective function and the constraints might be nonlinear and nonconvex. For solving these problems, Couenne uses a reformulation procedure and provides a linear programming approximation of any nonconvex optimization problem.
Optimization Programming Language (OPL) is an algebraic modeling language for mathematical optimization models, which makes the coding easier and shorter than with a general-purpose programming language. It is part of the CPLEX software package and therefore tailored for the IBM ILOG CPLEX and IBM ILOG CPLEX CP Optimizers. The original author of OPL is Pascal Van Hentenryck.
Artelys Knitro is a commercial software package for solving large scale nonlinear mathematical optimization problems.
Google OR-Tools is a free and open-source software suite developed by Google for solving linear programming (LP), mixed integer programming (MIP), constraint programming (CP), vehicle routing (VRP), and related optimization problems.
HiGHS is open-source software to solve linear programming (LP), mixed-integer programming (MIP), and convex quadratic programming (QP) models.