Abstract

Ranking and selection (R&S) procedures have been widely studied and applied in determining the required sample size (i.e., the number of replications or batches) for selecting the best system or a subset containing the best system from a set of k alternatives. Most of the studies in the R&S have focused on a single measure of system performance. In many practical situations, however, we need to select systems based on multiple criteria. A solution is called Pareto optimal if there exists no other solution which is better in all criteria. This paper discusses extending a R&S procedure to select a Pareto set containing non-dominated systems. Computational results show that the proposed procedures are effective in obtaining non-dominated systems.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call