Публікація:
Combinatorial approaches to the capital-budgeting problem

dc.contributor.authorPichugina, O.
dc.date.accessioned2018-03-29T14:02:14Z
dc.date.available2018-03-29T14:02:14Z
dc.date.issued2016
dc.description.abstractOptimization 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.uk_UA
dc.identifier.citationPichugina 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.uk_UA
dc.identifier.urihttp://openarchive.nure.ua/handle/document/4460
dc.language.isoenuk_UA
dc.publisherLUBLIN–RZESZOWuk_UA
dc.subjectcapital-budgeting problemuk_UA
dc.subjectinteger programminguk_UA
dc.subjectknapsack problemuk_UA
dc.subjectcombinatorial optimizationuk_UA
dc.titleCombinatorial approaches to the capital-budgeting problemuk_UA
dc.typeArticleuk_UA
dspace.entity.typePublication

Файли

Оригінальний пакет
Зараз показано 1 - 1 з 1
Завантаження...
Зображення мініатюри
Назва:
Pichugina_2016.pdf
Розмір:
428.9 KB
Формат:
Adobe Portable Document Format
Ліцензійний пакет
Зараз показано 1 - 1 з 1
Немає доступних мініатюр
Назва:
license.txt
Розмір:
9.42 KB
Формат:
Item-specific license agreed upon to submission
Опис:

Колекції