Comparative analysis of COPT and Gurobi solvers in mathematical programming
Performances of the COPT and Gurobi solvers in linear programming and mixed integer programming are tested on the Python Language.The COPT and Gurobi are used to solve specific examples of different planning problems.The optimal results and computing times are compared and analyzed with statistical methods.It is finally proved that the COPT solver and the Gurobi solver have the same accuracy for both types of optimization problems,but the COPT solver is faster than the Gurobi solver for linear programming problems,while the former is slower than the latter for mixed integer programming problems.