Skip to main content

Solving multi-dimensional knapsack problems.

Answered

Comments

1 comment

  • Ryuta Tamura
    Gurobi Staff Gurobi Staff

    Hi,

    If I understand correctly, you are interested in enumerating "all" feasible solutions. In such use case, SolutionPool feature and PoolSearchMode parameter might help. By setting PoolSearchMode to 2, Gurobi will search n-best solutions. If n is large enough, all feasible solutions can be found.
    However, please note that the number of feasible solutions of MIP easily divergent. Hence, enumerating all solutions may not be possible in practice. In fact, the number of combinations of p foods can be \( O(2^p) \), and in your case \( 2^{1200}\)!! Of course, this reduced by the constraint, but this value exceeds the maximum value of the signed integer \( 2^{31}-1\).

    Thanks,
    Ryuta

    0

Please sign in to leave a comment.