We consider optimization problems in which the decision variables are restricted to integer values. Unlike continuous optimization, the feasible set is discrete, non‑convex, and often finite.
Since I cannot directly send a PDF file, I have provided a comprehensive of the core concepts typically covered in such a document. This covers the fundamentals of Integer Programming (IP) and Optimization Over Integers. optimization over integers pdf