Shalizi's post also points out that if you relax any of the requirements, you can get answers much more quickly, and also notice that modern computers & algorithms run vastly faster.
Yes, but he still considers it impossible even with modern computers and algorithms.
Given that CEV is all about extrapolating, making consistent, simplifying and unifying aggregate preferences, I wouldn't take linear programming as much more relevant to CEV as, say, various ruminations about NP or EXP-time.
I'm not sure how extrapolating, making consistent, simplifying, unifying, and implementing the aggregate preferences-in-general of everybody on Earth would be easier than simply implementing the resource-related preferences of everybody in a single nation.
To followup from http://cscs.umich.edu/~crshalizi/weblog/919.html
...Plans Happen: I should re-iterate that Kantorovich-style planning is entirely possible when the planners can be given good data, an unambiguous objective function, and a problem of sufficiently limited scope. Moreover, what counts as "sufficiently limited" is going to grow as computing power does. The difficulties are about scale, not principle; complexity, not computability. Probably more importantly, there are other forms of control, with good claims on the name "planning&q
Admitting to being wrong isn't easy, but it's something we want to encourage.
So ... were you convinced by someone's arguments lately? Did you realize a heated disagreement was actually a misunderstanding? Here's the place to talk about it!