Integer Linear Programming - Using Binary Variables in Constraints (Part 1)

This video shows some examples on how binary variables is or can be used in constraints of Linear Programming models

[bluetaurean]

You explain the topic so fluently making the topic easy to understand. I wish you would make a full series with mathematical optimization but with real world examples. Also appreciate if you could recommend books covering these topics with real world examples.

[SheilaaSwift]

this video helped me so much. thank you so much sir! youre amazing, please continue to make videos!

[xondiego]

Pretty good, it is very intuitive way to understand the logical constrains.But the case either or is linear, I would say, since all constrains are linear, but it is not possible to solve with the methods avaible since they only works in feasible regions that are convex, in the example supplied there are two feasible regions, for example the simplex method won't work since the feasible region is compunded of two simplex, i.e, two simplex that in sum are not convex. Is it right?
Apart from that this is golden material. Thanks again God bless you!!

[merin_here_am_i]

Hello sir, How to find the convexity, boundedness and feasibility of bilp problem mathematically? please respond