Skip to main content

What is the most efficient way to generate a random solution from all possible solutions that comply with some constraints in a MIP?

Awaiting user input

Comments

4 comments

  • Official comment
    Simranjit Kaur
    • Gurobi Staff
    This post is more than two years old. Some information may not be up to date. For current information, please check the Gurobi Documentation or Knowledge Base. If you need more help, please create a new post in the community forum, or try Gurobot, our chatbot interface offering instant, expert-level support.
  • Eli Towle
    • Gurobi Staff

    I can't think of a better way to accomplish this task using a MIP. To ensure the solution is random, you need to first enumerate all solutions. In general, enumerating all solutions of a MIP is computationally expensive.

    0
  • Jizhou Lu
    • Gurobi-versary
    • First Comment
    • First Question

    It doesn't have to be completely random but deviates from the optimal solution, if I have an objective function. In the above case, the model picks "n best solutions", which is too biased. Is it possible to address this issue?

    0
  • Eli Towle
    • Gurobi Staff

    I don't see a way to address this using solution pools. Could you solve the problem repeatedly, perturbing or randomizing the objective function at each iteration to obtain a set of solutions that optimize different objectives? Of course, this approach also does not offer any guarantees about the randomness of solutions.

    0

Post is closed for comments.