Taking remainders in gurobi

回答済み

Shesha Sreenivasamurthy

• 2024年10月10日 07:23
• 編集済み

Hi, I was interested in taking remainder in Gurobi and I referenced the following post.

https://support.gurobi.com/hc/en-us/community/posts/5878990407185-How-to-take-the-remainder-of-the-variables-in-gurobi

However, I am facing an issue.

I want to perform T % 32. Say T is 320 and I expect the remainder to be 0. To formulate this, I have 320 = 32 * a + b. Gurobi gave result a = 9, b = 32. How to ensure that 'b' gets the minimum value. So, 'a' should be 10 and 'b' is zero.

0

• 

  Shesha Sreenivasamurthy

  • 2024年10月10日 07:26

  

  

  I think I found the answer, I set upper bound for b to be 31. Let me know if this not the right way.

  0
• 

  Matthias Miltenberger

  Gurobi Staff

  • 2024年10月10日 09:37
  • 編集済み

  Hi Shesha,

  a=9 and b=32 is a perfectly valid solution to the problem. To enforce that Gurobi selects a solution that minimizes the remainder b, you need to specify exactly that and add b to your objective function.

  Setting the upper bound of the remainder to be n-1 for n being the modulo value, is also a good idea nonetheless.

  I hope that helps.

  Cheers,
  Matthias

  0
• 

  Shesha Sreenivasamurthy

  • 2024年10月11日 04:21

  

  

  Thank you !

  0

サインインしてコメントを残してください。