Skip to main content
SpringerLink
Log in

A Dual Algorithm to Solve Linear Least Absolute Value Problems

  • Theoretical Paper
  • Published:
Journal of the Operational Research Society

Abstract

This paper presents a special purpose dual linear programming algorithm to solve a linear least absolute value multiple linear regression problem. Various computer implementations of the fundamental algorithm are discussed and compared with existing special-purpose procedures to solve the least absolute value problem. Computational results with four implementations of the algorithm are given.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Quantitative Business Analysis, College of Business, University of Georgia and Department of Management Science, California State University of Fullerton,

    Ronald D. Armstrong & Mabel Tam Kung

Authors
  1. Ronald D. Armstrong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mabel Tam Kung
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Armstrong, R., Kung, M. A Dual Algorithm to Solve Linear Least Absolute Value Problems. J Oper Res Soc 33, 931–936 (1982). https://doi.org/10.1057/jors.1982.197

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/jors.1982.197

Search

Navigation