Tag: Global optimization

What the study found The study presents Multiple Objective Probabilistic Branch and Bound with Single Observation (MOPBnB(so)), an algorithm for approximating the Pareto optimal set and the associated efficient frontier in stochastic multi-objective optimization problems. Why the authors say this matters The authors indicate that the algorithm is intended to handle noisy objective evaluations more…