This is a preview. Log in through your library . Abstract This paper presents an algorithm, based on the simplex routine, that provides a way to solve a problem in which the objective function is not ...

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 ...