A comparison of interval linear programming with the simplex method

DOI10.1016/0024-3795(81)90016-1zbMath0464.90053OpenAlexW2033961798WikidataQ114852105 ScholiaQ114852105MaRDI QIDQ1154389

G. J. Anders, Eldon A. Gunn

Publication date: 1981

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(81)90016-1

zbMATH Keywords

simplex methodcomputational studycomparison of algorithmsinterval linear programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Interval and finite arithmetic (65G30)

Cites Work

• A primal algorithm for interval linear-programming problems
• A suboptimization method for interval linear programming: A new method for linear programming
• Unnamed Item
• Unnamed Item

This page was built for publication: A comparison of interval linear programming with the simplex method