qNParEGO (Noisy Pareto Efficient Global Optimization ) is a batch variant of ParEGO suitable for noisy settings. qNParEGO converts a multi-objective problem into a single-objective problem by applying a random scalarization of the objectives. By choosing a different weight vector for scalarization at each iteration of the search, an approximate Pareto front can be built up gradually.