Consider the problem Ax = b; max z = ∑cj|xj|. This problem cannot, in general, be solved with the simplex method. The problem has a simplex-method solution (with unrestricted basis entry) only if cj are nonpositive (nonnegative for minimizing problems).
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.