Minimization discrete values.

nico

Hello,

Here is my problem: I have an arrays d1 and dref holding 20 values each (d1[20] dref[20]). I want to minimize f=sum(abs(d1[i]-dref[i])), by changing values of d1. My constraints are: *sum(d1[i]) is constant sum(d1[i]) at begining = sum(d1[i]) at end *max(d1[i])=cst and min(d1[i])=cst

What kind of minimization is it? Can I find some libraries (c++ or fortran) that could help me on that.

Regards,

Nico