Efficiently Adding a Large Number of Constraints in Gurobi for MILP Problem
I am working on a large-scale Mixed Integer Linear Programming (MILP) problem using Gurobi. The decision variable vector x
is binary and has a dimension of approximately n = 40,000,000
. The objective function is defined as: