The problem seems to be that lack of an objective function.
In the transition from branch and bound to branch and bound and cut,
bound lost billing: branch and cut.
With an all-zero objective function, the solver cannot do bounding.
Every solution will be dual-degenerate.
That messes up selection of entering variables for dual pivots.
Try giving the problem an arbitrary objective,
perhaps index numbers or their recipricols.
--
Michael henne...@web.cs.ndsu.nodak.edu
"Sorry but your password must contain an uppercase letter, a number,
a haiku, a gang sign, a heiroglyph, and the blood of a virgin."
-- someeecards
