Skip to main content

COPT (Cardinal Optimizer) is a mathematical optimization solver for large-scale problems. It is developed by Cardinal Operations. 

According to third-party benchmarks by Hans Mittelmann  Benchmarks for Optimization Software COPT is among the fastest solvers for various optimization problems.

COPT supports solving Linear Programming (LP), Second-Order-Cone Programming (SOCP), Convex Quadratic Programming (QP), Convex Quadratically Constrained Programming (QCP), Semidefinite Programming (SDP) and Mixed Integer Programming (MIP), which include Mixed Integer Linear Programming (MILP), Mixed Integer Second-Order-Cone Programming (MISOCP), Mixed Integer Convex Quadratic Programming (MIQP), Mixed Integer Convex Quadratically Constrained Programming (MIQCP).

COPT supports all major operating systems (64-bit), including Windows, Linux, and MacOS. It provides interfaces to Python, PuLP, Pyomo, C, C++, C#, Julia, Java, AIMMS, AMPL, GAMS and CVXPY. We also support ARM64 and Apple M1 platforms.

Introduction to COPT

An introduction to COPT (Cardinal Optimizer) can be found here:

Free Trial

The latest version of COPT can be downloaded here for free for public testing and evaluation: