Алгоритмизация и программная реализация метода исключения переменных в полиномиальных задачах оптимизации

Abstract

The method of sequential exclusion of variables in polynomial optimization problems is considered. A number of problems are solved using this method. The practical steps of an algorithm are described, which reduces the initial polynomial optimization problem to a multi-stage branching process of obtaining a finite number of alternative problems, the output of which gives a finite set of polynomials in one variable. As a result, solving a number of polynomial problems reduces to sorting out a finite number of vectors whose components are the real roots of polynomials.