Combinatorial approaches to the capital-budgeting problem

Pichugina, O.

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

dc.contributor.author	Pichugina, O.
dc.date.accessioned	2018-03-29T14:02:14Z
dc.date.available	2018-03-29T14:02:14Z
dc.date.issued	2016
dc.description.abstract	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.	uk_UA
dc.identifier.citation	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.	uk_UA
dc.identifier.uri	http://openarchive.nure.ua/handle/document/4460
dc.language.iso	en	uk_UA
dc.publisher	LUBLIN–RZESZOW	uk_UA
dc.subject	capital-budgeting problem	uk_UA
dc.subject	integer programming	uk_UA
dc.subject	knapsack problem	uk_UA
dc.subject	combinatorial optimization	uk_UA
dc.title	Combinatorial approaches to the capital-budgeting problem	uk_UA
dc.type	Article	uk_UA
dspace.entity.type	Publication