Technical Note—“Linear” Programming with Absolute-Value Functionals

David F. Shanno and Roman L. Weil
Additional contact information
David F. Shanno: University of Toronto, Toronto, Ontario, Canada
Roman L. Weil: University of Chicago, Chicago, Illinois

Operations Research, 1971, vol. 19, issue 1, 120-124

Abstract: Consider the problem Ax = b ; max z = ∑ c j | x j |. This problem cannot, in general, be solved with the simplex method. The problem has a simplex-method solution (with unrestricted basis entry) only if c j are nonpositive (nonnegative for minimizing problems).

Date: 1971
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.1.120 (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:oropre:v:19:y:1971:i:1:p:120-124

Access Statistics for this article

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