title: Overlapping constraint in linear programming
body: <p>I am trying to implement a constraint for non overlapping rectangles. I found this link:
  <a href="http://yetanothermathprogrammingconsultant.blogspot.com/2017/07/rectangles-no-overlap-constraints.html" rel="nofollow noreferrer">http://yetanothermathprogrammingconsultant.blogspot.com/2017/07/rectangles-no-overlap-constraints.html</a></p>
  <p>But I dont quite understand why the sum of the binary variable should be less or equal to 3 like in the picture below. Shouldn't it be only two of the constraints that should be true at the same time so that the sum should be less or equal to two?</p>
  <p><a href="https://i.stack.imgur.com/HKUGD.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/HKUGD.png" alt="enter image description here" /></a></p>