DietCOLA does not complain when input problem does not have any conic section (when problem is just a MILP). It performs a branch and bound search to solve the input MILP.