find optimum solution

[ahmedhamdy2010]

Hi everyone,

i need your help in this vi, I have 4 2D arrays, gin, gjn, gif and gjf, 42X20 ... where the 42 represent different casses, and 20 represents 20 observations for each case. the objective is that for each case independantly, all the observations of gin must be larger than gjn, and all observations of gif is less than gjf.... of course this is not the case, so i'm searching for single  value L1 and a single value L2 to add to gi and gj to make these conditions true for all the 42 cases (each case is independant). (L1 and L2 are ln(x) functions)

i tried to write a vi to do this, but somehow it doesn't work as expected... your help will be appreciated

thanks

[Yamaeda]

For each case, subtrace gjn from gin and find the lowest negative number (which means gjn is bigger). Subtract this negative number (which'll be an addition) to all the values of that case.

Do the same for all cases and similarly for the other 2 arrays.

/Y

[ahmedhamdy2010]

thank you, sounds very good, i will try it and get back to you 🙂