Kian, R.Berk, EmreGürler, Ülkü2020-02-072020-02-0720190167-6377http://hdl.handle.net/11693/53168In this paper, we consider a particular form of inequalities which involves product of multiple variables with rational exponents. These inequalities can equivalently be represented by a number of conic quadratic forms called cone constraints. We propose an integer programming model and a heuristic algorithm to obtain the minimum number of cone constraints which equivalently represent the original inequality. The performance of the proposed algorithm and the computational effect of reformulations are numerically illustrated.EnglishSecond-order cone programmingCone constraintsConic reformulationArticle10.1016/j.orl.2019.09.004