Author: Maksymets Denys
Supervisor: Tarabarov Serhiy
Summary: Graduate work consists of 88 pages of explanatory note and includes 29 illustrations, 6 tables, 18 references and 4 applications. The aim of the thesis is to develop a modified simplex method of Nelder Mead algorithm and investigate the modifications using the set of functions of varying complexity. The thesis includes the analyzes of existing methods of optimization of order zero. The Neldera and Mead algorithm is investigated, its advantages and disadvantages are described. The algorithm Neldera and Mead is described. The modified algorithm was developed and described. The program for the graphical display of methods using C # programming language and technology of Windows Forms is described. A research of the modified method by the example of the five functions of varying complexity is completed. The results, which reflect the efficiency of the developed modifications are displeyed. The developed modification of Nelder Mead algorithm is recommended to use for optimize processes which are described by functions of several variables.
Keywords: design, nelder mead algorithm, optimization
The work consists of: 88 pages of explanatory note and 4 appendix
Explanatory note: Full text