-
Related to #228, opening a new bug since I can't reopen the old one and this is a new example.
We are still seeing failures in gapfilling for Archaea with version 1.3.1. I attached an example from…
-
Hello
I would like to understand whether cbc solver uses Revised simplex method to solve linear programming problem and uses Branch and bound algorithm to solve MIP problems.
How to perform post…
-
The purpose of this ticket is to
- connect SageMath to interfaces to optimization solvers that are maintained outside of the Sage project,
- integrate the related developer and user communities…
-
Greetings,
I have two problems where HiGHS returns incorrect results. In the first problem the solution returned is suboptimal and in the second it is incorrectly reported as infeasible. Turning pres…
-
1. Run an optimisation with the CPLEX LP solver and add `solver.options['mip_limits_solutions'] = some_positive_integer`
2. The solver status will be `'ok'`, the termination condition will be `'unkno…
-
We shouldn't be failing MINLPTests. They're intended to be "easy" to solve:
https://github.com/jump-dev/Pavito.jl/blob/5805d1d652250c4c27b99c80041a323b8e9d7888/test/jump_tests.jl#L49-L58
-
## Summary
The GDPopt LBB algorithm does not find a solution for a problem where the Boolean solution is already fixed.
### Steps to reproduce the issue
```
m = ConcreteModel()
m.x = Var(bo…
-
`minizinc --help` does not print all options.
In particular, it does not document the `--all-solutions` option or its synonyms.
MiniZinc IDE 2.7.2, macOS 13.3.3 Intel.
Current output below, per…
-
@ssardina The paper mentions that they get optimal solns from the COIN solver too, which is open source.
I had a play with clingcon on some dummy examples - https://github.com/potassc…
-
I don't think it is a bug but I am facing issues with the mipstart option of the cbc solver.
I have a problem I would like to decompose into two steps and I would like to initialize the second probl…