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

Operations Research, Vol. 21, No. 1, Mathematical Programming and Its Applications (Jan. - Feb., 1973), pp. 156-161 (6 pages) This paper gives rules that enable the transformation of a 0-1 polynomial ...

Start working toward program admission and requirements right away. Work you complete in the non-credit experience will transfer to the for-credit experience when you ...