Consider the problem Ax = b; max z = ∑c j |x j |. This problem cannot, in general, be solved with the simplex method. The problem has a simplex-method solution (with unrestricted basis entry) only if c j are nonpositive (nonnegative for minimizing problems).
No takes yet. Share an insight, caveat, or question.
Shanno et al. (1971) studied this question.