We show that the following problem is NP-hard, and hence computationally intractable: "Given a vector y that Lorenz-dominates a vector x, what is the smallest number of Muirhead–Dalton transfers that transform x into y?"
Deineko, V. G., Klinz, B., & Woeginger, G. J. (2009). The complexity of computing the Muirhead-Dalton distance. Mathematical Social Sciences, 57(2), 282-284. https://doi.org/10.1016/j.mathsocsci.2008.11.005