Hi, according to me CPLEX is the best one but you can also try:

FortMP or XPRESS

Hello,

Cplex is one of the best solvers for linear problems. It is not simple to find better. If you use already Cplex, you can try the tuning tool provided with the solver. this tool tries different parameter settings and seeks to find good parameters for the solver for a given optimization model. So at the end, you will have a set of parameters to use to solve quickly your problem.

You can also try "Xpress Mp" of Fico. It seems to be efficient to solve the same kind of problems. Personnaly, I did not see a big difference between those solvers on my MILP problems.

thank you for your help

Besides the aforementioned Xpress, there is also Gurobi, which is a MIP solver developed by the same team that initially developed Cplex. In my experience, Gurobi is more or less at the same speed of Cplex, but for some problems it's much faster (and others, it's much slower...), and it is worth giving a try, in particular, because it is free of charge for academic use.

Try this article : Comparisons of Commercial MIP Solvers and an Adaptive Memory (Tabu Search) Procedure for a Class of 0-1 Integer Programming Problems avaiable at https://pdfs.semanticscholar.org/26d9/0fb0b8271e5cbcf44e11baaea10bce01b802.pdf

Hi,

Does anybody know Cplex? I am currenty programming a production problem where i m minimizing the setup cost. I have my production with product 1 & 2, period 1-3 and a microperiod 1-3. Now i want to schedule that if product 1 was produced for ex. in period 1 and microperiod 2 and product 2 is produced in period 1 and microperiod 3, i have setup costs.

Here is what i tried:

minimize obj_holding_cost+obj_production_cost+obj_backorder_cost+obj_setup_cost;

subject to {

forall(t in T, p in P)

if(t=b_z[m][i][t-1][s]+b_z[m][j][t][s]-1;

forall(i, j in P:i!=j, m in M,t in T:t>1, s in S:s=b_z[m][i][t][1]+b_z[m][j][t-1][s]-1;

forall(i, j in P:i!=j, m in M,t in T:t>1, s in S)

b_W[m][i][j][t][s]>=b_z[m][i][t][3]+b_z[m][j][t-1][s]-1;

forall(i, j in P:i!=j, m in M,t in T, s in S:s>1)

b_W[m][i][j][t][s]>=b_z[m][i][t][s]+b_z[m][j][t][s]-1;

I hope someone can help me.

Thank you in advance.