Simplex Method + Branch and Bound

Linear programming is a very common approach for solving and approximating 
a variety of problems.  Usually these problems are solved using the simplex
method.  Most of the time, however, we're interested in solving intractable
integer programs.  The Branch and Bound technique is a method for repeatedly
applying the Simplex Method to optimally solve an integer program, and 
this technique is often used in practice to solve otherwise intractable 
problems.  I will briefly define a linear program, then describe both the 
simplex method and how to use the Branch and Bound technique.