This note gives simple and straightforward reasoning for obtaining the results of Shanno and Weil [Opns. Res. 19, 120-124 (1971)] for linear programming with absolute-value functionals. With over ...

A routine written in IML to solve this problem follows. The approach appends slack, surplus, and artificial variables to the model where needed. It then solves phase 1 to find a primal feasible ...

Constrained minimization problems are formulated from a quasilinear parabolic boundary value problem (possibly with nonlinear boundary conditions), making use of the ...