Resumen
We present a technique to solve the linear integer model with variable bounding. By using the continuous optimal solution of the linear integer model, the variable bounds for the basic variables are approximated and then used to calculate the optimal integer solution. With the variable bounds of the basic variables known, solving a linear integer model is easier by using either the branch and bound, branch and cut, branch and price, branch cut and price, or branch cut and free algorithms. Thus, the search for large numbers of subproblems, which are unnecessary and common for NP Complete linear integer models, is avoided.