GENERALIZATIONS OF BERNSTEIN POLYNOMIALS IN PROBLEMS OF MULTIOBJECTIVE OPTIMIZATIONJournal: Science and world (Vol.1, No. 6)
Publication Date: 2014-02-28
Authors : Zakharov V.V.; Kravtsov A.M.; Priymenko S.A.;
Page : 38-40
Keywords : Bernstein polynomials; optimization algorithms; parallel programming.;
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.
Other Latest Articles
Last modified: 2014-08-05 15:07:38