A variable transformation method for solving linear absolute-value objective-function problems with linear constraints
Using the well-known simplex algorithm a variable transformation method is derived to solve the linear absolute-value objective-function problem with linear constraints. From the numerical point of view it is known that this method is not the best one.
scientific article; zbMATH DE number 4028778