1764 eng reportzib 0 2013-01-14 2013-01-14 -- This is a technical report for the SCIP constraint handler cons_bivariate. We describe a cut-generation algorithm for a class of bivariate twice continuously differentiable functions with fixed convexity behavior over a box. Computational results comparing our cut-generation algorithms with state-of-the-art global optimization software on a series of randomly generated test instances are reported and discussed. 1438-0064 urn:nbn:de:0297-zib-17641 Martin Ballerstein Stefan Vigerske Dennis Michaels Stefan Vigerske 13-02 eng uncontrolled bivariate functions eng uncontrolled convex envelope eng uncontrolled global optimization eng uncontrolled linear underestimator Global optimization (NEW) Nonconvex programming, global optimization Polyhedral combinatorics, branch-and-bound, branch-and-cut Mathematical Optimization Mathematical Optimization Methods Vigerske, Stefan MIP-ZIBOPT MODAL-SynLab MODAL-Gesamt Applied Optimization https://opus4.kobv.de/opus4-zib/files/1764/ZR-13-02.pdf https://opus4.kobv.de/opus4-zib/files/1764/ZR-13-02_testset.tgz https://opus4.kobv.de/opus4-zib/files/1764/ZR-13-02revised.pdf