6464 eng reportzib 0 -- 2017-07-20 -- We investigate how the numerical properties of the LP relaxations evolve throughout the solution procedure in a solver employing the branch-and-cut algorithm. The long-term goal of this work is to determine whether the effect on the numerical conditioning of the LP relaxations resulting from the branching and cutting operations can be effectively predicted and whether such predictions can be used to make better algorithmic choices. In a first step towards this goal, we discuss here the numerical behavior of an existing solver in order to determine whether our intuitive understanding of this behavior is correct. Operations Research Proceedings 2017 1438-0064 urn:nbn:de:0297-zib-64645 Matthias Miltenberger Matthias Miltenberger Ted Ralphs Daniel Steffy 17-43 eng uncontrolled Mixed Integer Programming eng uncontrolled Linear Programming eng uncontrolled Algorithm Analysis OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING Mathematical Optimization Mathematical Optimization Methods Miltenberger, Matthias ASTfSCM MIP-ZIBOPT MODAL-SynLab MODAL-Gesamt Applied Optimization https://opus4.kobv.de/opus4-zib/files/6464/ZR-17-43-published.pdf