Abstract
This paper considers some programming problems with absolute-value (objective) functions subject to linear constraints. Necessary and sufficient conditions for the existence of finite optimum solutions to these problems are proved.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Shanno, D. F., andWeil, R. L.,“Linear” Programming with Absolute Value Functionals, Operations Research, Vol. 19, No. 1, 1971.
Kaplan, S.,Comment on a Precis by Shanno and Weil, Management Science, Vol. 17, No. 11, 1971.
Ravindran, A., andHill, T. W., Jr.,A Comment on the Use of Simplex Method for Absolute Value Problems, Management Science, Vol. 19, No. 5, 1973.
Author information
Authors and Affiliations
Additional information
Communicated by G. L. Nemhauser
The authors thank the reviewer for his valuable comments.
Rights and permissions
About this article
Cite this article
Hill, T.W., Ravindran, A. On programming with absolute-value functions. J Optim Theory Appl 17, 181–183 (1975). https://doi.org/10.1007/BF00933924
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF00933924