“…The Nelder-Mead method iteratively generates a sequence of interested vertex points which converge to an optimal vertex point of objective function f(x) [10]. At each iteration, the vertices xi are ordered according to the objective function values (6) where x1 is the best vertex and xn+1 is the worst vertex. The algorithm uses four possible operations: reflection, expansion, contraction and shrink, each being associated with a scalar parameter: α (reflection), β (expansion), γ (contraction), and δ (shrink).The values of α, β, γ and δ are lying in the range of >0, >1 and 0 to 1 in both γ and δ respectively.…”