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

Solving Non convex MIQCP in reasonable time

ユーザーの入力を待っています。

コメント

2件のコメント

  • 正式なコメント
    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 Ritesh,

    Do you think it is the dual or the primal bound that are really slow? To improve the primal bound (best feasible point), you might want to try to experiment with the NoRelHeurTime parameter. For the dual bound, you might want to experiment with the Presolve, MIPFocus, PreSparsify, OBBT parameters.

    Non-convex models require tight variable bounds for good convergence. You might want to try to provide as tight bounds as possible for any variable participating in a bilinear term.

    Often, reformulating a non-convex model is the best way to gain performance. You could share the model. Note that uploading files in the Community Forum is not possible but we discuss an alternative in Posting to the Community Forum.

    Best regards, 
    Jaromił

    0

投稿コメントは受け付けていません。