K.Sh. Mamedov, N.O. Mamedli
Methods for finding suboptimistic and subpessimistic solutions to interval part of the integer programming problem

A mixed-integer programming problem with interval source data is considered. The concepts of admissible, optimistic, pessimistic, suboptimistic and subpessimistic solutions for the problem under investigation are introduced. Based on one economic interpretation of the problem, methods for finding suboptimistic and subpessimistic solutions are proposed. The programs of the developed method are compiled and a number of computational experiments are carried out. The mean estimates of the errors of these solutions in optimistic and pessimistic solutions are found. As a result of experiments, the effectiveness of the developed methods is confirmed once again.

Keywords: Permissible, Optimistic, Pessimistic, Lower and upper bounds, Computational experiments, Errors