# A problem with SOCP constraint

**URL:** <https://discourse.julialang.org/t/a-problem-with-socp-constraint/79414>\
**Category:** Optimization (Mathematical)\
**Tags:** jump\
**Created:** [April 13, 2022, 4:15am UTC](https://discourse.julialang.org/t/a-problem-with-socp-constraint/79414 "2022-04-13T04:15:31Z")\
**Posts on this page:** 1\
**Showing post:** 2

<div class="post-metadata">

**Author:** ![gdalle](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/gdalle/32/27854_2.png) [@gdalle](https://discourse.julialang.org/u/gdalle)\
**Post date:** [April 13, 2022, 4:25am UTC](https://discourse.julialang.org/t/a-problem-with-socp-constraint/79414/2 "2022-04-13T04:25:29Z")

</div>

Hi and welcome!  
It is hard to tell what went wrong without a Minimum Working Example (see the [forum guidelines](https://discourse.julialang.org/t/please-read-make-it-easier-to-help-you/14757)), maybe you could provide one?  
If `branch` is a variable, the problem could come from the indexing `V[Int.(real(branch[:,1])),:]`.  
Otherwise, my best guess is that SOCP constraints don’t accept multiplications (`V .* I` or squares `P.^2`) _inside_ the constraint, since it is their job to square stuff. But I’m not sure about this.

---

_[View the full topic](https://discourse.julialang.org/t/a-problem-with-socp-constraint/79414)._