Sajjad Hedayati

Conversationalist
First Question
  • Total activity 14
  • Last activity
  • Member since
  • Following 0 users
  • Followed by 0 users
  • Votes 2
  • Subscriptions 3

Activity overview

Latest activity by Sajjad Hedayati
  • Sajjad Hedayati commented,

    Hi, Thank you for your suggestion. Although your solution seems to work, I couldn't have applied it to my model. I wonder if there is any solution to get those extreme points in which there are som...

  • Sajjad Hedayati created a post,

    Calling Shadow Prices Under Degeneracy

    Ongoing

    Dear Gurobi community I wonder if there is any possibility that we can get degeneracy information of a degenerate optimal basic feasible solution. In fact, I need to drop those constraints that are...

  • Sajjad Hedayati commented,

    I think that I have received the answer. Thank you, Mario!  

  • Sajjad Hedayati created a post,

    Issues with adding valid inequalities

    Answered

    Hi everyone I have a full integer model with both binary and positive integer variables. I would like to extract the relaxed LP solutions and apply some valid inequality. I already know that MIPNOD...

  • Sajjad Hedayati commented,

    Thanks, Mario!

  • Sajjad Hedayati commented,

    I think that I got my answer regarding the B&B. Thank you! What if we have a heuristic and we want to use its solution for our next optimization step by Gurobi? Like two-stage programming strategie...

  • Sajjad Hedayati commented,

    Thank you again for your explanation. Now, I wonder if you could help me with the following strategy: - Imagine we get a lower bound and an infeasible solution that is integral obtained from an ind...

  • Sajjad Hedayati commented,

    Hi Mario, Thank you for the information. According to your answer, two questions are possible: 1- If I implement my own branch-and-bound algorithm via gurobipy, I will need to use the LP model and ...

  • Sajjad Hedayati created a post,

    Applying LR to the B&B for MIPs

    Answered

    Hi everyone I am trying to apply Lagrangian Relaxation to Branch-and-Bound to solve a MIP problem. How can I use LR during branching? I know that I have to use callbacks but I do not know how I can...