The problem of locating p maximally dispersed points in a convex space is considered. This problem is formulated as a non-linear programming problem. It is shown that this problem, in a square, is ...

This paper develops a new algorithm for solving the general nonlinear programming problem that melds the flexible simplex search of Nelder and Mead with various additional rules to take care of ...