メインコンテンツへスキップ

Finding all feasible solutions for an MILP problem?

回答済み

コメント

1件のコメント

  • Eli Towle
    • Gurobi Staff

    If you set PoolSearchMode to 2 and PoolSolutions to 2e9, Gurobi will search for the best two billion distinct feasible solutions to your model. If your model has less than two billion distinct feasible solutions, Gurobi will search for all distinct feasible solutions.

    Note there are some caveats related to (i) defining what it means for two solutions to be distinct, and (ii) how the MIPGap and MIPGapAbs parameters influence the solution pool. These caveats are described in the Solution Pool > Subtleties and Limitations section of the documentation.

    0

サインインしてコメントを残してください。