If at Most 3 of 7 Projects Are to Be $\le$

True/False

If at most 3 of 7 projects are to be performed, this can be modeled by X₁ + X₂ + X₃ + X₄ + X₅ + X₆ + X₇ $\le$ 3, where X₁, X₂, X₃, X₄, X₅, X₆, and X₇ are all restricted to be non-negative, have an upper bound of 1, and be integer-valued.