Linear programming for weighted deviation problems using compact basis techniques

DOI10.1016/0377-2217(78)90007-3zbMath0391.90055OpenAlexW2077040245MaRDI QIDQ1251590

Fred Glover

Publication date: 1978

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(78)90007-3

zbMATH Keywords

Goal ProgrammingLinear ProgrammingPrimal and Dual SimplexWeighted Deviation

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Linear programming (90C05)

Cites Work

• Unnamed Item
• On the discrete linear L\(_1\) approximation and L\(_1\) solutions of overdetermined linear equations
• Generalized upper bounding techniques
• Algorithms for best \(L_ 1\) and \(L_ \infty\) linear approximations on a discrete set
• An interval programming algorithm for discrete linear \(L_ 1\) approximation problems
• Linear Programming Techniques for Regression Analysis
• An Efficient Method for the Discrete Linear L 1 Approximation Problem
• Applications of Linear Programming to Numerical Analysis
• A generalized upper bounding method for doubly coupled linear programs
• The 1972 Wald Lecture Robust Statistics: A Review
• Discrete approximation in the L1 norm
• An Improved Algorithm for Discrete $l_1 $ Linear Approximation