Abstract
A large-scale linear assignment problem is considered under the assumption that the coefficients of the objective function are imperfectly known but have a probability distribution. Asymptotic approximations are derived by using the statistical theory of extremes. It is shown how the resulting approximate problem has an easily computable form, provides a closed-form solution which has the structure of a logit model, and is embedded by a mathematical program whose objective function is related to entropy.
Get full access to this article
View all access options for this article.
