This is the eleventh video of the lecture series Optimization using Excel. In this video, we have discussed a special type of binary integer programming known as the Set-covering problem. The following sets of constraints are the last five constraints that were left for the viewers when we discussed the algebraic LP formulation in this video. x6 ≥ 1 for Shahdara x3 + x5 + x7 + x8 + x9 ≥ 1 for Karol Bagh x3 + x5 + x7 + x8 + x9 ≥ 1 for PaharGanj x3 + x5 + x7 + x8 + x9 ≥ 1 for Central Delhi x10 ≥ 1 for South Delhi