Computational Management Science Business, Management and Accounting (miscellaneous)
Analyzing location models by the maximum possible value of perfect information
Abstract
In decision analysis, the expected value of perfect information (EVPI) is a commonly used evaluation tool. We focus on the concept of maximum possible EVPI (MaxVPI) and demonstrate its relationship with one of the decision analysis criteria, minimax regret. The maximum possible EVPI is easy to evaluate because there is no need to estimate the probabilities of the states of the world. The MaxVPI is an achievable upper bound, meaning that there is a set of probabilities for which EVPI=MaxVPI, and the EVPI for any set of probabilities cannot exceed MaxVPI. We demonstrate this approach on two stochastic facility location models, in the context of both finite and infinite states of the world as well as available options. We also consider a situation in which only partial information about the probabilities is given.