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

Optimal Solution Discrepancy Between Convex and Non-Convex Models

回答済み

コメント

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.
  • Maliheh Aramon
    • Gurobi Staff

    Hi Chenhui, 

    What version of Gurobi are you using?

    Starting from Gurobi version 11.0.0, nonconvex models are solved to global optimality using outer approximation and spatial branch-and-bound when the parameter FuncNonlinear is set to 1.

    Before Gurobi version 11.0.0, nonconvex models were solved by replacing the nonlinear constraints with their piecewise-linear approximations. Therefore, the solution using this approach is an approximation though it can be very close to the actual optimal solution depending on the number of pieces used to approximate the nonlinear functions. 

    Please check the General Constraints documentation for more details on how Gurobi handles nonlinear functions.

    Since solving nonconvex models is more challenging in terms of computation time and accuracy, solving your problem as a convex optimization model is generally preferable.

    Best regards,

    Maliheh

    0

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