John Forrest

Normally the user wants to find out why the problem is infeasible - so the default action for Clp is to solve it without presolve so the user can get...

-moreSpecial 1 - output with fake problem stable/debug/bin/cbc /tmp/infeas.mps -moreSpecial 1 -solve (default strategy 1) At line 1 NAME          AFIRO ..... Coin0008I AFIRO read with 0 errors moreSpecialOptions was changed...

Will look further - was fine when I tried on stable. Otherwise I could modify one of the Cbc examples (which have all flexibility of standalone) and then have event...

My mistake.  My suggestion stopped Clp but not cbc.  This is because Cbc does initialSolve and then resolve if it thinks there may be problems (resolve does not do the...

Brandon, You mentioned the -primal flag. Normally the time in branch and bound is the vast majority of time in solving an integer problem, so it does not really matter...

Hopefully fixed in stable.  The AMPL objective value can be set in several places - it looked to me that one was wrong.  The change to CbcSolver.cpp is trivial -...

John, It works in master. Difficult to fix in a release, but the change to CbcSolver.cpp is small - diff --git a/Cbc/src/CbcSolver.cpp b/Cbc/src/CbcSolver.cpp index 4d0e3e3f..320bd12a 100644 --- a/Cbc/src/CbcSolver.cpp +++ b/Cbc/src/CbcSolver.cpp...

This is really the same problem as #189 You will have to use master to fix problems. The limit on dualBound was increased to 1.0e20 last year on master. Also...

I have coded (but not yet completely tested) a hack for mipStart. The idea was to extend mipStart so that variables which were not mentioned were set to one of...

When a subproblem is solved, it may end up being solved by the dual algorithm or the primal algorithm. The dual algorithm returns infeasible immediately the bound is violated, so...