Search academic texts

Information × Registration Number 0222U003198, 0120U103381 , R & D reports Title Discretr structures, correctness,algorithmic complexity of discrete optimization problems and of the graphs theory. popup.stage_title Head Sergienko Ivan V., Доктор фізико-математичних наук Registration Date 21-02-2022 Organization V.M. Glushkov Institute of Cybernetics of National Academy of Sciences of Ukraine popup.description2  Algorithms for local search of optimal solutions of bi-level discrete optimization problems with different principles of optimality under conditions of uncertainty, incomplete information are developed and substantiated. Practical applications of these problems associated with the optimization of the distribution of interbudget transfers within a given limitations. The theory of perturbed cones is developed and improved. Such cones organize the set of feasible solutions of the optimization problem with respect to the vector criterion and are used as a tool to analyze and reduce the influence of uncertainty in the input data on the solutions of the vector problem. Qualitative characteristics of solvability of vector optimization problems under conditions of possible perturbations in the input data are developed; conditions of stable and unstable solvability of vector problems with different principles of optimality on unbounded convex feasible set are established. The stability of vector optimization problems with different types of variables (partial-integer) in case of possible perturbations in the input data is studied. Product Description popup.authors Lebedeva Tetyana Tarasivna Semenov Viktor Viktorovych Semenova Natalia Volodymyrivna Sergienko Tetyana Ivanivna Chaika Dariia Oleksandrivna popup.nrat_date 2022-03-09 Close