Stepanchuk T. The algorithms for solving the some classes of the optimization problems that reduced to the optimal set partitioning problems

Українська версія

Thesis for the degree of Candidate of Sciences (CSc)

State registration number

0402U002793

Applicant for

Specialization

  • 01.05.01 - Теоретичні основи інформатики та кібернетики

30-09-2002

Specialized Academic Board

К 08.051.09

Essay

The research object - the problems of global optimization, of construction the optimal quadrature formulae, of the group choice. The research aim is to construct the uniform algorithmic approach to solving these problems on the basis of the the non-differentiable infinite-dimensional optimization theory and the functional analysis. The new algorithms for solving these problems with the help of the optimal partitioning method were developed and grounded. The effectiveness of the algorithms was investigated at many model problems. All algorithms were realized in the form of modern software, necessary for solving practically important problems, that appear in real life in the sphere of engineering, economics and sociology.

Files

Similar theses