Linear programming is arguably one of the most basic forms of optimization. Its theory and algorithms can not only be applied to linear optimization problems but also to relaxations of nonlinear problems and branch-and-bound methods for mixed-integer and global optimization problems. Recent research shows that against intuition bad condition numbers frequently occur in linear programming. To take this into account reliability is required. Here we investigate rigorous results obtained by verification methods. We will examine different current techniques and software tools for verified linear programming and compare numerical results for existing implementations.
Citation
Submitted to SIOPT.