THE CONCEPT OF GUARANTEED SOLUTION THROUGH THE FUNCTIONAL FOR MUTIDIMENTIONAL KNAPSACK PROBLEM AND METHODS OF ITS CONSTRUCTION
Науковий журнал «Радіоелектроніка, інформатика, управління»
Переглянути архів Інформація| Поле | Співвідношення | |
| ##plugins.schemas.marc.fields.042.name## |
dc |
|
| ##plugins.schemas.marc.fields.245.name## |
THE CONCEPT OF GUARANTEED SOLUTION THROUGH THE FUNCTIONAL FOR MUTIDIMENTIONAL KNAPSACK PROBLEM AND METHODS OF ITS CONSTRUCTION |
|
| ##plugins.schemas.marc.fields.720.name## |
Mamedov, К. Sh.; Institute of Control Systems of the National Academy of Sciences of Azerbaijan, Baku, Azerbaijan Mamedov, N. N.; National Aviation Academy of Azerbaijan, Baku, Azerbaijan |
|
| ##plugins.schemas.marc.fields.653.name## |
one-dimensional and multidimensional knapsack problems; guaranteed solution and guaranteed suboptimal solution through the functional; non-linear multicriteria the problem of Boolean programming; dichotomy approach; computational experiment. |
|
| ##plugins.schemas.marc.fields.520.name## |
Contex. The problem of constructing a guaranteed suboptimal (approximate) solution with respect to a functional in one-dimensional and multidimensional knapsack problems is considered. The object of the study was a model with an increment of the coefficients of the objective function.<br />Objective. The methods of constructing guaranteed suboptimal solution through the functional in one-dimensional and multidimensional<br />knapsack problem has been developed.<br />That is it is necessary to find such minimal changes coefficient of the objective function in the set of integer intervals so that the solution<br />found guarantees the value of the functional not less than the predetermined value.<br />Method. The concept of guaranteed solution and guaranteed suboptimal solution relative to the objective function in the satchel problem<br />is introduced. It is necessary to find such minimal changes coefficient of the objective function in the set of integer intervals so that the<br />solution found guarantees the value of the functional not less than the predetermined value. Such kind of solution we name as guaranteed<br />solution through the functional for one-dimensional and multidimensional knapsack problem. The methods of their construction has been developed. A software package was developed to find these solutions and numerous computational experiments were performed on random large-dimensional problems.<br />Results. The algorithm of constructing guaranteed suboptimal solution through the functional in one-dimensional and multidimensional<br />knapsack problem has been developed.<br />Conclusions. A software package was developed to find the concept of guaranteed solution and guaranteed suboptimal solutions and<br />numerous computational experiments were performed on random large-dimensional problems. |
|
| ##plugins.schemas.marc.fields.260.name## |
Zaporizhzhya National Technical University 2018-05-29 13:24:17 |
|
| ##plugins.schemas.marc.fields.856.name## |
application/pdf http://ric.zntu.edu.ua/article/view/132481 |
|
| ##plugins.schemas.marc.fields.786.name## |
Radio Electronics, Computer Science, Control; No 1 (2018): Radio Electronics, Computer Science, Control |
|
| ##plugins.schemas.marc.fields.546.name## |
ru |
|
| ##plugins.schemas.marc.fields.540.name## |
Copyright (c) 2018 К. Sh. Mamedov, N. N. Mamedov |
|