Sajjad Hedayati

  • Gurobi-versary
  • Conversationalist
  • First Question
  • 合計アクティビティ 14
  • 前回のアクティビティ
  • メンバー登録日
  • フォロー 0ユーザー
  • フォロワー 0ユーザー
  • 投票 2
  • サブスクリプション 3

アクティビティの概要

Sajjad Hedayatiさんの最近のアクティビティ
  • Sajjad Hedayatiさんがコメントを作成しました:

    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さんが投稿を作成しました:

    Calling Shadow Prices Under Degeneracy

    進行中

    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さんがコメントを作成しました:

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

  • Sajjad Hedayatiさんが投稿を作成しました:

    Issues with adding valid inequalities

    回答済み

    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さんがコメントを作成しました:

    Thanks, Mario!

  • Sajjad Hedayatiさんがコメントを作成しました:

    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さんがコメントを作成しました:

    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さんがコメントを作成しました:

    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さんが投稿を作成しました:

    Applying LR to the B&B for MIPs

    回答済み

    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...