Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[docs] add bounds to big-M examples #3720

Merged
merged 1 commit into from
Apr 1, 2024
Merged

[docs] add bounds to big-M examples #3720

merged 1 commit into from
Apr 1, 2024

Conversation

odow
Copy link
Member

@odow odow commented Apr 1, 2024

Copy link

codecov bot commented Apr 1, 2024

Codecov Report

All modified and coverable lines are covered by tests ✅

Project coverage is 98.42%. Comparing base (177d213) to head (f54df52).

Additional details and impacted files
@@           Coverage Diff           @@
##           master    #3720   +/-   ##
=======================================
  Coverage   98.42%   98.42%           
=======================================
  Files          43       43           
  Lines        5828     5828           
=======================================
  Hits         5736     5736           
  Misses         92       92           

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.

@odow odow merged commit 374c614 into master Apr 1, 2024
11 checks passed
@odow odow deleted the odow-patch-1 branch April 1, 2024 22:51
@remi-garcia
Copy link
Contributor

Thanks for the quick commit.

However, this is not consistent anymore with "If the solver doesn't support indicator constraints and the variables do not have a finite domain, you an use the big-M trick."

I believe that something like "If the solver doesn't support indicator constraints, you can use the big-M trick (which requires variables to have a finite domain)." would be better suited.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Development

Successfully merging this pull request may close these issues.

2 participants