Find N solutions
Open
enhancement
- Dominant language
- Linear Programming
- Stars
- 600
- Forks
- 108
- PR merge metrics
- No merged PRs in 30d
Description
Is it possible to force optimization to continue until N integer solutions are found?
Example:
Let's say N=3 and there are 2 optimal solutions with the same value of objective function, like 10.0. Since I need 3 solutions, the third one would be a suboptimal one, where objective function is worse, like 11.0.
Is it possible to achieve with mip package?
Contributor guide
No contributing guide indexed for this repository
Assessment
This issue has not been assessed yet.