How many decision variables can be solved for Mixed Integer Programming?
<p>I have a Mixed Integer Programming problem(binary integer variables), how many variables can I solve, i.e, upper limit and what would be time taken? </p>

<p>The problem would have a utmost 5 constraints and a minimisation cost function, but variables are in the form of a matrix of m*n. So, the question is what could be the max values of m and n, also the time it would take to finish the computation?</p>

<p>Using standard software/libraries like COIN CBC, GLPK, CPLEX, GUROBI.</p>