The Mathematical Model of the Optimal Choice of a Software Package for an Enterprise Information System

The mathematical definition of the optimal choice problem for software package for an enterprise information system is considered. The problem of the optimal software package choice is a mathematical model of combinatorial optimization on a set of combinations. The algorithm for solving this problem is presented for finding the minimum value of the target function considering additional linear constraints. This method makes it possible to significantly simplify the finding procedure of the optimal solution, since inequalities in the growth of constraints allow us to immediately determine whether a point in the set of combinations will be a support solution or not. In the positive case, the support solution is improved, taking into account the properties of many combinations when directly checking the growth of the target function. The algorithm and its realization are demonstrated by a numerical example. The proposed mathematical model and solution algorithm can be used for a similar class of problems that are modeled by optimization models, where the set of feasible solutions is presented in the many combinations form.