A Feasible Solution to a Two-Variable Pure Integer Programming Problem

True/False

A feasible solution to a two-variable pure integer programming problem can always be found by first solving the corresponding linear programming problem (i.e. problem obtained by ignoring the integrality constraints) and by rounding to the nearest integer all fractional values in the optimal solution to the linear programming problem.