|
Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2008, Volume 14, Number 2, Pages 48–57
(Mi timm23)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Mathematical Programming
One approach to solving a discrete production planning problem with interval data
M. V. Devyaterikova, A. A. Kolokolov, A. P. Kolosov
Abstract:
In this paper, we develop an approach to solving integer programming problems with interval data based on using the possibilities of varying the relaxation set of the problem. This is illustrated by means of an $L$-class enumeration algorithm for solving a dicrete production planning problem. We describe the algorithm and a number of its modifications and present results of a computational experiment for families of problems from the OR Library and with randomly generated initial data. This approach is also applied to obtain approximate solutions of the mentioned problem in its conventional setting.
Received: 03.03.2008
Citation:
M. V. Devyaterikova, A. A. Kolokolov, A. P. Kolosov, “One approach to solving a discrete production planning problem with interval data”, Trudy Inst. Mat. i Mekh. UrO RAN, 14, no. 2, 2008, 48–57; Proc. Steklov Inst. Math. (Suppl.), 263, suppl. 2 (2008), S37–S46
Linking options:
https://www.mathnet.ru/eng/timm23 https://www.mathnet.ru/eng/timm/v14/i2/p48
|
Statistics & downloads: |
Abstract page: | 437 | Full-text PDF : | 137 | References: | 83 |
|