Sometimes I encounter problems where Simplex spends many iterations for final convergence to the optimal objective value. Let's suppose, this happens when solving branch and bound-tree nodes as well. Could it be worthwhile to solve the dual of the node instead and limit the number of simplex iterations?
If my thinking is correct, this could give you some useful information and increase the node throughput in pathological cases. While the non-optimal objective could be used as bound, we'd end up with lots of primal-infeasible solutions to nodes. Perhaps it's possible to completely solve only a subset?
Is this idea workable or did I miss something? Do you know of research in this direction?