Roskladka A. The parametrical tasks and stability at modeling by the Euclidean combinatorial tasks of optimiza tion

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

Thesis for the degree of Candidate of Sciences (CSc)

State registration number

0400U002469

Applicant for

Specialization

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

20-09-2000

Specialized Academic Board

К 08.051.09

Essay

Plant of a research - parametrical tasks of optimization on Euclidean combinatorial sets. The purpose of work - development of methods and algorithms of their solution. The researches were carried out with application of the theory and methods of Euclidean combinatorial optimization. The amplified estimates of minimum of strongly convex differentiated objectives functions for a set of combinations with repetitions are obtained. The algorithms of problem solving with a parameter for sets of combinations with repetitions and arrangements are created and their complexity also is investigated. For general set of combinations the modified algorithm of a construction a convex environment is developed. New criterion of i-edges of any polyhedron is established. The parametrical optimization mathematical models tasks on combinations are constructed. An area of use are economy (scheduling, control).

Similar theses