Skip to main content

Maximizing convex function

Answered

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

    Hi,

    Does that mean gurobipy replaces the objective function with a piecewise linear function? 

    No, Gurobi only uses piecewise-linear approximations if you use the addGenConstr methods.

    For nonconvex models, Gurobi uses the spatial B&B approach.

    In your particular case, the model is so easy, that Gurobi is able to solve it in its presolve step.

    Best regards, 
    Jaromił

    1
  • Hussein Sharadga
    • Gurobi-versary
    • Investigator
    • Conversationalist

    Thank you so much! Jaromił Najman 

    I am working on a large-scale problem and wanted to know if all constraints are linear or convex with a nonconvex objective function that gurobipy can solve it in affordable computing time.

     

    Best,

    Hussein

    0
  • Jaromił Najman
    • Gurobi Staff

    Hi Hussein,

    I am working on a large-scale problem and wanted to know if all constraints are linear or convex with a nonconvex objective function that gurobipy can solve it in affordable computing time.

    This cannot be stated a priori. The only way to find out is to actually construct the model and try to solve it.

    Best regards, 
    Jaromił

    1

Post is closed for comments.