The linear program that results from dropping the integer requirements for the variables in an integer linear program is known as LP relaxation (definition). When solving an IP, if the solution to the LP relaxation is integral, then the optimal solution to the IP has been obtained. (T/F)