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 ...
https://doi.org/10.2307/2583200 • https://www.jstor.org/stable/2583200 Copy URL A linear programming problem is presented to solve a problem in determining how many ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback