Can SOCPs approximate better than LPs? Posted by Sriram Sankaranarayanan, at or.stackexchange.com, 26 Jun 2019 Are there any classes of NP-hard combinatorial optimization problems where Second order cone programs (SOCP) gives a better…