AI SearchA study on the efficiency of the interactive simplex and the pattern search methods in a noise situation - with an application on the rural development planning
Chalerm Yiengsubhanond
A study on the efficiency of the interactive simplex and the pattern search methods in a noise situation - with an application on the rural development planning - Bangkok : Asian Institute of Technology, 1983 - vi, 21 p. - Thesis ; no. CA-83-26 . - Asian Institute of Technology. Thesis ; no. CA-83-26 .
A thesis submitted in partial fulfillment of the requirement for the degree of Master of Engineering, School of Engineering and Technology
Thesis (M.Eng.) - Asian Institute of Technology, 1983
This study aims at investigating the performance of the interactive simplex and the pattern search methods when the values of the function to be optimized have random noises. Experiments are performed to comparatively evaluate the performance of the two methods. The evaluation criteria used are: optimal solution reached, approximately rate of convergence and computational time. The results of the experiments show that the interactive simplex method resulting in a modified one. Experiments are also performed to evaluate the performance of the unmodified and the modified interactive simplex methods. The evaluation criteria used for this case are: the optimal solution reached, rate of convergence, computational time and the number of function evolution. In order to indicate the usefulness of the interactive simplex method, an application on rural development planning in which human errors may occur is made. The method is implemented on a microcomputer and an actual planning example is shown.
Rural development--Computer programs
Interactive computer systems
A study on the efficiency of the interactive simplex and the pattern search methods in a noise situation - with an application on the rural development planning - Bangkok : Asian Institute of Technology, 1983 - vi, 21 p. - Thesis ; no. CA-83-26 . - Asian Institute of Technology. Thesis ; no. CA-83-26 .
A thesis submitted in partial fulfillment of the requirement for the degree of Master of Engineering, School of Engineering and Technology
Thesis (M.Eng.) - Asian Institute of Technology, 1983
This study aims at investigating the performance of the interactive simplex and the pattern search methods when the values of the function to be optimized have random noises. Experiments are performed to comparatively evaluate the performance of the two methods. The evaluation criteria used are: optimal solution reached, approximately rate of convergence and computational time. The results of the experiments show that the interactive simplex method resulting in a modified one. Experiments are also performed to evaluate the performance of the unmodified and the modified interactive simplex methods. The evaluation criteria used for this case are: the optimal solution reached, rate of convergence, computational time and the number of function evolution. In order to indicate the usefulness of the interactive simplex method, an application on rural development planning in which human errors may occur is made. The method is implemented on a microcomputer and an actual planning example is shown.
Rural development--Computer programs
Interactive computer systems