About One Task of Mixed Integer Programming of Large Dimension and its Solving Algorithm

Abstract

One method of solving the mixed-integer task of a special type is offered in this paper, which emerges when solving the task of production placement by a modified method of Benders. The task is solved by the branch and boundary method. Calculative experiments are shown and optimal or close to optimal variants of production placement are gained. The scheme of branching is offered, which is economic if considering the required computer memory. Also, the rules of the rejection process of variants are offered.