Editing CPLEX (section)

== Features ==
The IBM ILOG CPLEX Optimizer solves [[integer programming]] problems, very large<ref>{{citation | title = Recent Benchmarks of Optimization Software | first = H. D. | last = Mittelmann | date = 10 July 2007 | location = EURO XXII Prague, Czech Republic | publisher = Dept of Math and Stats Arizona State University|work=22nd European Conference on Operational Research}}</ref> [[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 Sharp (programming language)|C#]], and [[Java programming language|Java]] languages.  There is a [[Python programming language|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]], [[General Algebraic Modeling System|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,<ref name="CPOptimizer2018">{{cite journal|vauthors=Laborie P, Rogerie J, Shaw P, Vilim P|date=2018|title=IBM ILOG CP optimizer for scheduling|journal=Constraints|volume=23|issue=2|pages=210–250|doi=10.1007/s10601-018-9281-x}}</ref> the [[Optimization Programming Language]] (OPL), and a tightly integrated IDE.