Solving linear programs with finite precision. I: Condition numbers and random programs

DOI10.1007/s10107-003-0393-7zbMath1082.90060OpenAlexW2006494263WikidataQ57733230 ScholiaQ57733230MaRDI QIDQ1424293

Dennis Cheung, Felipe Cucker

Publication date: 11 March 2004

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-003-0393-7

zbMATH Keywords

linear programmingcondition number

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05)

Related Items

Probabilistic analyses of condition numbers ⋮ Solving linear programs with finite precision. II: Algorithms ⋮ Optimal routing in double loop networks ⋮ Intrinsic volumes of symmetric cones and applications in convex programming ⋮ A hybrid branch-and-bound approach for exact rational mixed-integer programming ⋮ Sign consistent linear programming problems

Uses Software

• mctoolbox