Публікація: Combinatorial approaches to the capital-budgeting problem
Завантаження...
Дата
2016
Автори
Назва журналу
ISSN журналу
Назва тома
Видавництво
LUBLIN–RZESZOW
Анотація
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.
Опис
Ключові слова
capital-budgeting problem, integer programming, knapsack problem, combinatorial optimization
Бібліографічний опис
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.