Comp geom problem?

[Ray Haraf]

Hello All,

Can someone help with either hints for analytical solution, if any, or heuristic in C (preferably in S) to solve the following? Given N observations to be placed into JK cells, my problem is to find a set of cut points J's and K's that maximizes
Z=[log(2\sum_j\sum_k(n_{jk}log n_{jk})
- 2\sum_k(n_{.k}log n_{.k})- 2\sum_j(n_{j.}log n_{j.}) + 2NlogN]/2 - [log(J-1)]/4 - [log(K-1)]/4 - [logN]/2
subject to: 
1<J<N
1<K<N
\sum_j\sum_k(n_{jk}) = N
\sum_j(n_{jk}) = n_{.k}
\sum_k(n_{jk}) = n_{j.}
J, K, and n_{jk} are integers.

Word 97 version is available upon request.
 
Thanks.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20011020/4b00ded4/attachment.htm