On Valid Inequalities for Mixed Integer p-Order Cone Programming |
| |
Authors: | Alexander Vinel Pavlo Krokhmal |
| |
Institution: | 1. Department of Mechanical and Industrial Engineering, University of Iowa, Iowa City, IA, 52242, USA
|
| |
Abstract: | We discuss two families of valid inequalities for linear mixed integer programming problems with cone constraints of arbitrary order, which arise in the context of stochastic optimization with downside risk measures. In particular, we extend the results of Atamtürk and Narayanan (Math. Program., 122:1–20, 2010, Math. Program., 126:351–363, 2011), who developed mixed integer rounding cuts and lifted cuts for mixed integer programming problems with second-order cone constraints. Numerical experiments conducted on randomly generated problems and portfolio optimization problems with historical data demonstrate the effectiveness of the proposed methods. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|