Hello community!!!
A query, related to multi-objective optimization... Will JMP be able to optimize the uncertainty of the random discrete inputs (integers) in "1 single step"?... that is, JMP will be able to find the best combination of inputs to use ( whole numbers) and the risk associated with each strategy?...and thus be able to search for strategies that allow minimizing risks while achieving the objectives?
That is, take any optimization problem and have JMP replace the uncertain values with probability distribution functions (integers - discrete) representing a range of possible values and for each trial solution found by JMP during optimization, JMP run a Monte Carlo simulation, finding the combination of adjustable cells that provides the best simulation results that minimize risk in the face of uncertainty?.