// priority 1: sum of columns as close to parent's width as possible
for(int i=0; i<coeff.length; i++) coeff[i] = (i<numregions) ? (float)(regions[i+1] - regions[i]) : (float)0.0;
coeff[numregions*2+numkids] = (float)-1.0;
- if (!findMinimum) lp_h.add_constraint(coeff, Simplex.LE, (float)width);
+ if (!findMinimum) lp_h.add_constraint(coeff, Simplex.EQ, (float)width);
else lp_h.add_constraint(coeff, Simplex.LE, (float)0);
int childnum = 0;