The book outlines the main provisions of the theory of discrete optimization (solvability, aggregation and canonical reduction of systems of equations in integers, a group approach to integer optimization problems, integer conditions for polyhedral sets). Methods of sequential analysis of variants, dynamic programming, branches and boundaries, approximate are described.