On integer programming problems with inaccurate data

In this paper, a criterion of feasibility and existence of the optimal solution is suggested as the basis for a unified general approach to the solution of eight classes of the integer programming problems with inaccurate data arising from the study of actual problems with a dynamic nature in the processes, an uncertainty of the available information, etc. A method is also described which can be applied to the solution of twelve classes of the above problems under a certain assumption. The results can be used for solving practical problems, for example, decision making, integer programming, as they reduce such problems to simpler models. These results may prove to be useful for theoretical analysis of the problems, for example, when studying the stability of the integer programming problems' solution.