Sth about IP

An Integer Programming without a objective function is a decision problem, instead of an optimization problem. Although the computational complexity is the same for both of them, decision problem is faster to solve, for it only requires one feasible solution (rather than the optimal one). In case an optimal solution is not neccesary, and bounds are given for a feasible one, such formulation is helpful.