Skip to main content

Inefficient solving of QIP

Awaiting user input

Comments

2 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.
  • Jaromił Najman
    • Gurobi Staff

    Hi Marius,

    Your code snippet is not reproducible, because multiple definitions of used lists and values are missing, cf. minimal reproducible example. Could you please update your post to make the code executable?

    If all \(w_P\) values are positive, you might want to try introducing auxiliary continuous variables and equality constraints

    \[\begin{align*}
    x_{n,p,m} = d_{n,m,p} - \sum_{b\in B}\hat{\beta}_{n,m} \delta_{n,m,p}
    \end{align*}\]

    and use \(x_{n,p,m}^2\) in the objective. This would lead to a convex quadratic problem with binary variables. It is not said that his solves faster but it might be worth a try.

    Best regards, 
    Jaromił

    0

Post is closed for comments.