Solve least absolute value regression problems using modified goal programming techniques.

DOI10.1016/S0305-0548(98)00016-1MaRDI QIDQ1406730zbMATH OpenFDO

Authors Han-Lin Li

Publication date 7 September 2003

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0305-0548(98)00016-1

zbMATH Keywords

Goal programmingleast absolute value regression

Mathematics Subject Classification ID

Linear inference, regression (62J99) Multi-objective and goal programming (90C29)

Cites work

• A Dual Algorithm to Solve Linear Least Absolute Value Problems
• A revised simplex algorithm for the absolute deviation curve fitting problem
• An efficient method for solving linear goal programming problems
• scientific article; zbMATH DE number 3841083 (Why is no real title available?)
• scientific article; zbMATH DE number 4083385 (Why is no real title available?)
• scientific article; zbMATH DE number 3675157 (Why is no real title available?)
• scientific article; zbMATH DE number 47262 (Why is no real title available?)
• scientific article; zbMATH DE number 194738 (Why is no real title available?)
• scientific article; zbMATH DE number 194757 (Why is no real title available?)
• scientific article; zbMATH DE number 1873657 (Why is no real title available?)
• Least Absolute Deviations Curve-Fitting
• Optimal estimation of executive compensation by linear programming

Cited in

(1)

• Distributionally robust \(L_1\)-estimation in multiple linear regression

Describes a project that uses

Uses Software

• LINDO
• Mathematica
• alr3

This page was built for publication: Solve least absolute value regression problems using modified goal programming techniques.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1406730)