Multi-index transportation problems with 1-nested structure
| Autor: | M. Kh. Prilutskii, L. G. Afraimovich, A. S. Katerov |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Scheme (programming language)
0209 industrial biotechnology Mathematical optimization Index (economics) Reduction (recursion theory) 010102 general mathematics Structure (category theory) Covering problems 02 engineering and technology 01 natural sciences Square (algebra) 020901 industrial engineering & automation Flow (mathematics) Fuzzy transportation Control and Systems Engineering 0101 mathematics Electrical and Electronic Engineering computer Mathematics computer.programming_language |
| Zdroj: | Automation and Remote Control. 77:1894-1913 |
| ISSN: | 1608-3032 0005-1179 |
| Popis: | Consideration was given to the solution of the multi-index transportation problems of linear and integer-linear programming. It was proposed to use the approach based on studying the reducibility of the multi-index transportation problems to the problem of the minimal cost in the treelike network. It was proved that within the framework of the reduction scheme the condition for 1-nesting of the multi-index problems is necessary and sufficient for reducibility to the problem of the minimal-cost flow problem on a treelike network. An algorithm was proposed to solve the 1-nested multi-index problems requiring as many computer operations as the square of variables in the original problem. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|