Computational experience concerning payoff tables and minimum criterion values over the efficient set (Q1095808)

Minimum criterion values from payoff tables have often been used in multiple objective linear programming (MOLP). The assumption has often been that the minimum criterion values from payoff tables provide reasonably accurate estimates of the minimum criterion values over the efficient set. In this paper, however, we report computational exprience that demonstrates that the discrepancies between the payoff table minima and the minima over the efficient set can often be large. This tends to imply that the field of multiple objective programming needs a better method than payoff tables for estimating the minimum criterion values over the efficient set. The paper concludes with a discussion of a simplex-based procedure for deterministically computing the minimum criterion values over the efficient set that has potential in large MOLP applications.