http://dspace.nbuv.gov.ua:80/handle/123456789/69396 Mon, 06 Apr 2026 14:36:33 GMT 2026-04-06T14:36:33Z http://dspace.nbuv.gov.ua:80/bitstream/id/206647/ http://dspace.nbuv.gov.ua:80/handle/123456789/69396 http://dspace.nbuv.gov.ua:80/handle/123456789/84967 Об управлении финансовыми стратегиями на рынке ценных бумаг Пепеляева, Т.А. It is investigated the task of financial strategies control on the financial market using the theory of Markov’s processes. Sun, 01 Jan 2006 00:00:00 GMT http://dspace.nbuv.gov.ua:80/handle/123456789/84967 2006-01-01T00:00:00Z http://dspace.nbuv.gov.ua:80/handle/123456789/84966 Об уточнении лагранжевых двойственных оценок в бинарных и булевых квадратичных задачах Стецюк, П.И.; Пардалос, П.М. The approach for improvement of dual lagrangian bounds in quadratic optimization problems with binary (±1) and boolean (0 −1) variables is considered. It is based on use of families superfluous constraints in form of equality, which for these problems can be constructed as a result of introduction new variable in the form of products already existing variable. Is shown, that the introduction of these constraints improves accuracy of lagrangian dual bounds problem. Sun, 01 Jan 2006 00:00:00 GMT http://dspace.nbuv.gov.ua:80/handle/123456789/84966 2006-01-01T00:00:00Z http://dspace.nbuv.gov.ua:80/handle/123456789/84965 Алгоритмы раскраски плоских графов Донец, Г.А. Two algorithms for colouring a maximal planar graphs (plane triangulation) with four colours are proposed . The first algorithm is based on solving system of linear equations by the module 2, which finds one variant of colorings. The second algorithm is based on solving system of linear inequalities by the module 3, which finds all variants of colorings. Sun, 01 Jan 2006 00:00:00 GMT http://dspace.nbuv.gov.ua:80/handle/123456789/84965 2006-01-01T00:00:00Z http://dspace.nbuv.gov.ua:80/handle/123456789/84964 Экстремальные задачи с коническими ограничениями Ненахов, Э.И. We consider nonlinear semidefinite problems. First-order optimality conditions are derived. An algorithm for solving convex programming with cone constraints is proposed. The algorithm globally converges. General parametric problem was investigated. Sun, 01 Jan 2006 00:00:00 GMT http://dspace.nbuv.gov.ua:80/handle/123456789/84964 2006-01-01T00:00:00Z