Pseudolinear programming

This short note revisits an algorithm previously sketched by Mathis and Mat his [SIAM Rev., 37 (1995), pp. 230-234] and used to solve a nonlinear hospi tal fee optimization problem. An analysis of the problem structure reveals how the Simplex algorithm, viewed under the correct light, can be the drivi ng force behind a successful algorithm for an almost linear problem. This p resentation is intended for students who have been exposed to the Simplex m ethod for linear programming and are progressing, via the Karush-Kuhn-Tucke r conditions, toward nonlinear optimization.