CPLEX – Wikipedia
IBM ILOG CPLEX Optimization Studio ( often informally refer to simply ampere CPLEX ) cost associate in nursing optimization software box .
history
[edit ]
[edit ]
The CPLEX Optimizer be diagnose for the simplex method acting arsenic enforced indiana the degree centigrade programming language, although today information technology besides support early character of mathematical optimization and propose interface early than C. information technology exist primitively develop aside robert E. Bixby and deal commercially from 1988 aside CPLEX optimization iraqi national congress. This be learn aside ILOG in 1997 and ILOG be subsequently learn aside IBM indium january 2009. [ two ] CPLEX continue to be actively develop by IBM .
feature [edit ]
The IBM ILOG CPLEX Optimizer solve integer program problem, very large [ three ] linear program problem exploitation either cardinal oregon double form of the simplex method oregon the barrier interior point method acting, convex and non-convex quadratic scheduling problem, and convex quadratically restrain problem ( resolve via second-order cone scheduling, oregon SOCP ).
Reading: CPLEX – Wikipedia
The CPLEX Optimizer get a model layer bid concert that leave interface to the C++, vitamin c #, and java language. there cost a python speech interface based on the speed of light interface. last, a stand-alone synergistic Optimizer feasible be provide for debug and other purpose. The CPLEX Optimizer be accessible through independent model organization such adenine AIMMS, AMPL, gam, OptimJ and TOMLAB. indium accession to that AMPL leave associate in nursing interface to the CPLEX CP Optimizer.
The full IBM ILOG CPLEX optimization studio consist of the CPLEX Optimizer for mathematical program, the CP Optimizer for constraint scheduling, [ four ] the optimization program language ( OPL ), and adenine tightly integrate IDE.
Read more : IBM – Wikipedia tiếng Việt
turn history [edit ]
prior to IBM get ILOG, the CPLEX team promulgated a exhaust history of CPLEX. [ five ]
| 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 |
