Note--A Comment on the Use of Simplex Method for Absolute Value Problems

Arunachalam Ravindran and Thomas W. Hill, Jr.
Additional contact information
Arunachalam Ravindran: Purdue University
Thomas W. Hill, Jr.: Purdue University

Management Science, 1973, vol. 19, issue 5, 581-582

Abstract: The linear programming approach to the absolute value problem is to transform the unrestricted variable by the difference of two nonnegative variables. This transformation creates an unbounded feasible region which may lead to erroneous solution. To avoid this, Kaplan [Kaplan, Seymour. 1971. Comment on a précis by Shanno and Weil. Management Sci. 17 (11, July) 778-780.] introduced a new constraint to bound the feasible region and suggested a solution scheme using the simplex method. We shall give two counter examples to the proposed scheme and discuss the difficulties involved with this particular class of problem.

Date: 1973
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.19.5.581 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:19:y:1973:i:5:p:581-582

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().