APPROXIMATE SOLUTIONS OF THE INTERVAL PROBLEM OF MIXED INTEGER PROGRAMMING
Keywords:
an interval problem of mixed-integer programming,, feasible,, optimistic,, pessimistic,, suboptimistic and sub-pessimistic solutionsAbstract
In this article the problem of mixed-integer programming with interval initial data is considered.The concepts of feasible, optimistic, pessimistic, suboptimistic and sub-pessimistic solutions were introduced in the considered problem. Based on the economic interpretation of the problem, the methods were proposed finding suboptimistic and sub-pessimistic solutions.
