Hello JMP community,
I am a new JMP user and had a question that I thought I would post to see if there are any tips for making my experiment more effective.
Basically I am running a DoE experiment involving a mixture of colors (red yellow and blue). I have a combination of colors that I start with and measure using a spectrophotometer. (For example: I start with a solution that is 1ml. It consists of 30% blue dye, 25% red dye, and 35% yellow dye. I then take a reading of this color in a spectrophotometer and get a wavelength that is unique to this mixture of colors)
I then use custom DoE design in JMP to create a table of combinations using mixture factors red, yellow, and blue (all with values of 0 to 1) with the goal set to minimize. After, I create those combinations and run them all through the spectrophotometer and see which one is closest to the mixture I am trying to find. (i.e take the reading of the resulting mixture and compare it to the reading of the mixture I am trying to re-create. If the reading of the original mixture reads 0.854, and a reading from a created mixture reads 0.754, the data I enter would be 0.1, with the lowest difference being the most desirable.)
I would like to repeat this process getting closer to the original color, seeing how many runs it may take me to get as close as possible. At the moment I will enter in the data I get from each run, look at the 'Fit Model' function and look at the 'maximum desirability' in the Prediction Profiler. I then will use Augment design and change the values of each factor to reflect the maximum desirability output. (i.e if the maximum desirability prediction indicates the combination with the lowest difference as 0.3 red, 0.3 blue, and 0.4 yellow, I would change the values of red and blue to be between 0.2 and 0.5, and yellow to be between 0.3 and 0.5) I then re run the experiment, repeating until I get a combination that is ~ equal to the desired combination.
I am just wondering if there might be a more efficient way of doing this, if there is a way I can use JMP to automatically take the existing data I have found and use that to automatically pick a range of combinations that are more likely to find the right combination, or if the way I am doing it currently is the most efficient.
thanks for any advice/tips