candidate of physical and mathematical sciences
Tel.: +38 (044) 526 21 78
Email: KuzmenkoVM@nas.gov.ua
ORCID: 0000-0003-2038-0031
Scopus ID: 23396992800
Web of Science ID: V -9956-2019
Google Scholar: 2uGorcsAAAAJ
Born in 1956. In 1979, he graduated from the Faculty of Management and Applied Mathematics of the Moscow State Technical University. Since 1977, he interned and worked at the Cybernetic Center in Kyiv. Since 1979, he has been working continuously at the Institute of Cybernetics named after V.M. Hlushkova National Academy of Sciences of Ukraine. In 1991, he defended his candidate's thesis in physical and mathematical sciences, specializing in the application of mathematical methods and models in scientific research.
Member of the editorial board of the collection of scientific works "Cybernetics and computer technologies".
Author near 90 scientific works.
- Optimization methods (National Aviation University)
- Fundamentals of discrete mathematics (Sikorsky National Technical University).
2022-2026 "Construction of guaranteed control of dynamic systems under various information assumptions"
2017-2021 "Methods and algorithms for solving optimization problems on combinatorial configurations and trajectories of dynamic systems"
2012-2015 "Methods and algorithms for modeling unbalanced processes of the economy of Ukraine"
2009-2011 "Effective parallel algorithms for solving problems on large-dimensional graphs"
2007-2008 Grant : INTAS 06-1000017-8909 "Development of a unified approach for solving inverse and optimization problems for distributed systems"
2001-2006 "Mathematical models and effective algorithms for optimization of complex systems in energy"
1998-2000 "Modeling of complex energy systems under conditions of uncertainty"
1992-1994 "Optimization of electronic on-board equipment of aircraft"
Chikrii G.Ts., Kuzmenko V.M. Solving the Soft Convergence Problem for Controlled Oscillatory Systems Based on the Time Dilation Principle. Cybern Syst Anal. 2023. 59 (3). P. 428–438. https://doi.org/10.1007/s10559-023-00577-z
Чикрій Г.Ц., Кузьменко В.М. Реалізація зближення коливних систем на основі принципу розтягування часу. Проблеми керування та інформатики. 2022. № 1. С. 25–36. http://doi.org/10.34229/1028-0979-2022-1-3
Kuzmenko V. A New Family of Expectiles and its Properties. Cybernetics and Computer Technologies. 2020. 3. P. 43–58. https://doi.org/10.34229/2707-451X.20.3.5
Kuzmenko V., Salam R., Uryasev S. Checkerboard copula defined by sums of random variables. Dependence Modeling, 2020. 8 (1). P. 70-92. https://doi.org/10.1515/demo-2020-0004
Golodnikov A., Kuzmenko V., Uryasev S. CVaR Regression Based on the Relation between CVaR and Mixed-Quantile Quadrangles. J. Risk Manag. 2019. 12 (3). 107. https://doi.org/10.3390/jrfm12030107
Kuzmenko V., Uryasev S. Kantorovich–Rubinstein Distance Minimization: Application to Location Problems. Large Scale Optimization in Supply Chains and Smart Manufacturing. Springer Optimization and Its Applications, 2019. 149. https://doi.org/10.1007/978-3-030-22788-3_3
Shang D., Kuzmenko V., Uryasev S. Cash flow matching with risks controlled by buffered probability of exceedance and conditional value-at-risk. Annals of Operations Research, 260 (1-2). Springer US, 2018. P. 501-514. https://doi.org/10.1007/s10479-016-2354-6
Trofymchuk O.M., Vasyanin V.A., Kuzmenko V.N. Optimization Algorithms for Packing of Small-Lot Correspondence in Communication Networks. Cybern Syst Anal. 2016. 52 (2). P. 258–268. https://doi.org/10.1007/s10559-016-9822-5
Keçeci N.F., Kuzmenko V., Uryasev S. Portfolio optimization with second-order stochastic dominance constraints and portfolios dominating indices. Robustness Analysis in Decision Aiding, Optimization, and Analytics. 2016. 241. P.285-298. https://doi.org/10.1007/978-3-319-33121-8_13
Trofymchuk O.M., Vasyanin V.A., Kuzmenko V.N. Complexity of One Packing Optimization Problem. Cybern Syst Anal. 2016. 52 (1). P. 76–84. https://doi.org/10.1007/s10559-016-9802-9
Goldengorin B., Kuzmenko V., Keane J., Tso MK-S. Optimal supplier choice with discounting. Journal of the Operational Research Society, advance online publication, February 24, 2010; 10 p. https://doi.org/10.1057/jors.2009.164
Pshenichnyi B.N., Nenakhov E.I., Kuzmenko V.N. Mixed method for solving the general convex programming problem. Cybernetics and Systems Analysis. 1998. 34 (4). P. 577–587. https://doi.org/10.1007/BF02667002
Pshenichnyi B.N., Nenakhov E.I., Kuzmenko V.N. Modified cutting plane method for minimization of a convex function. Cybernetics and Systems Analysis. 1997. 33 (6). P. 867–873. https://doi.org/10.1007/BF02733226