Abstract
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 of the described 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 obtained results can be used for solving practical problems, for example, decision making, integer programming, as they enable to reduce such problems to simpler models. These results may prove to be useful for theoretical analysis of the mentioned problems, for example, when studying the stability of the integer programming problems solution
*The research described in this publication was made possible in part by Grant N K4C100 from the Joint Fund of the Government of Ukraine and International Science Foundation
*The research described in this publication was made possible in part by Grant N K4C100 from the Joint Fund of the Government of Ukraine and International Science Foundation
Notes
*The research described in this publication was made possible in part by Grant N K4C100 from the Joint Fund of the Government of Ukraine and International Science Foundation