simplex

What's the best way to initialize a simplex for use in a Nelder-Mead simplex search from a user's 'guess' vertex? I'm not sure if there is a best way to choose the initial simplex in the Nelder-Mead method, but the following is what is done in common practice. The construction of the initial simplex S is obtained from generating n+1 vertices x0,..,xn around what you call a user's "guess" vertex xin in a N dimensional space. The most frequent choice is x0=xin and the remaining n vertices are then generated so that xj=x0+hj*ej where ej is the unit vector of the j -th coordinate axis in R^n and

I am unable to find an implemenation of simplex method.I have a set of points and want to minimize theie distance so i only need the method simplex I have google before posting this question and could nt find anything that I could use /* What: Simplex in C AUTHOR: GPL(C) moshahmed/at/gmail. What: Solves LP Problem with Simplex: { maximize cx : Ax <= b, x >= 0 }. Input: { m, n, Mat[m x n] }, where: b = mat[1..m,0] .. column 0 is b >= 0, so x=0 is a basic feasible solution. c = mat[0,1..n] .. row 0 is z to maximize, note c is negated in input. A = mat[1..m,1..n] .. constraints. x = [x1..xm] are