OPTIMIZATION OF THE QUANTITY OF APPLICATIONS WITH A GIVEN BUDGET OF INNOVATIONS

  • Дмитрий Юрьевич Картушин Southern Federal University
  • Анжела Руслановна Максименкова Southern Federal University
  • Геннадий Анатольевич Угольницкий Southern Federal University
DOI: https://doi.org/10.17308/meps.2016.6/1464
Keywords: genetic algorithms, discrete optimization, selection of innovative projects

Abstract

Purpose: the paper is devoted to the problem of selection of the innovative projects applications with a given budget. Discussion: the problem is formalized as a knapsack one and solved by methods of discrete optimizations and genetic algorithms. Results: we implemented some algorithms of discrete optimization and genetic algorithms of solution of the knapsack problem and analyzed its comparative efficiency by several criteria in test examples.

Downloads

Download data is not yet available.
Published
2016-08-08
How to Cite
Картушин, Д. Ю., Максименкова, А. Р., & Угольницкий, Г. А. (2016). OPTIMIZATION OF THE QUANTITY OF APPLICATIONS WITH A GIVEN BUDGET OF INNOVATIONS. Modern Economics: Problems and Solutions, 6, 20-33. https://doi.org/10.17308/meps.2016.6/1464
Issue
Vol 6 (2016): june
Section
Mathematical Methods in Economics