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

A. Kh. Abdullayev
B.M. Aliyeva

DOI: 10.19085/journal.sijmas050701


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.


mixed integer programming, branch and bound, Benders decomposition method, the task of placement

Full Text:



  • There are currently no refbacks.

Copyright (c) 2018 Scholedge International Journal of Multidisciplinary & Allied Studies ISSN 2394-336X

Creative Commons License
The published articles/papers in the journal are licensed under a Creative Commons Attribution-NonCommercial 4.0 International License subject to Scholedge R&D Center's Copyright Notice.