Question $15(1$ point$)$

Let Constraint T: $3x1+x290,$

Constraint S: $3x1+2x2120,$

Constraint W: $x1-x20,$

All variables are required to be non$-$negative. Let the objective function be Max: $x1+x2.$ The optimal solution for this problem is $(24,24).$ The non$-$binding constraint will be

Constraint T

Constraint S

Constraint W

No non$-$binding constraint