Combinatorial approaches to the capital-budgeting problem
Електронного архіву Харківського національного університету радіоелектроніки (Open Access Repository of KHNURE)
Переглянути архів Інформація| Поле | Співвідношення | |
| Title |
Combinatorial approaches to the capital-budgeting problem
|
|
| Creator |
Pichugina, O.
|
|
| Subject |
capital-budgeting problem
integer programming knapsack problem combinatorial optimization |
|
| Description |
Optimization approaches, combinatorial and continuous, to a capital-budgeting problem (CBP) are presented. This NP-hard problem, traditionally modelled as a linear binary problem, is represented as a biquadratic over an intersection of a sphere and a upersphere. This allows applying nonlinear optimization to it. Also, the method of combinatorial and surface cuttings (MCSC) is adopted to (CBP). For the single constrained version (1CBP), new combinatorial models are introduced based on joint analysis of the constraint, objective function, and feasible region. Equivalence of (1CBP) to the multichoice knapsack problem (MCKP) is shown. Peculiarities of Branch&Bound techniques to (1CBP) are described. |
|
| Date |
2018-03-29T14:02:14Z
2018-03-29T14:02:14Z 2016 |
|
| Type |
Article
|
|
| Identifier |
Pichugina O. Combinatorial approaches to the capital-budgeting problem / O. Pichugina // Econtechmod. An international quarterly journal on economics in technology,new technologies and modelling processes – 2016. – Vol. 5, № 4 – P. 29–36.
http://openarchive.nure.ua/handle/document/4460 |
|
| Language |
en
|
|
| Publisher |
LUBLIN–RZESZOW
|
|