Cuts for Conic Mixed-Integer Programming

A conic integer program is an integer programming problem with conic constraints. Conic integer programming has important applications in finance, engineering, statistical learning, and probabilistic integer programming. Here we study mixed-integer sets defined by second-order conic constraints. We describe general-purpose conic mixed-integer rounding cuts based on polyhedral conic substructures of second-order conic sets. These cuts can be readily incorporated in branch-and-bound algorithms that solve continuous conic programming relaxations at the nodes of the search tree. Our preliminary computational experiments with the new cuts show that they are quite effective in reducing the integrality gap of continuous relaxations of conic mixed-integer programs. Key words: Integer programming, conic programming, branch-and-cut.

• Type: Conference
• Year: 2007
• Where: IPCO
• Authors: Alper Atamtürk, Vishnu Narayanan
• Keywords: Conic, Conic Integer, Integer Programming, IPCO 2007, Optimization