GENERALIZATIONS OF BERNSTEIN POLYNOMIALS IN PROBLEMS OF MULTIOBJECTIVE OPTIMIZATION

The algorithm for approximate solution of the problem of multiobjective optimization based on the presenting objective functions and constraint functions on functions by functions of a special kind ? continual predicates is suggested. The presentations are constructed by means of function approximation with generalizations of Bernstein polynomials. The computer implementation of the algorithm is focused on the use of parallel and vector computations.