At the core of the problems we shall be considering, lies the class of integer programming problems. From our earlier discussion of optimization and decision problems, we know that these problems can either be convex and linear or NP -complete. Thus they span the space from very simple computing tasks to extremely complex optimization problems. Now we shall examine standard methods for solving these problems in the framework of mathematical programming.