I have an MILP where we have $$ t_k = \sum_i P_i\cdot C_{ik} : P_i\ \in \{0,1\}, C_{ik} \in I^+ $$
and our model is constrained by the number of times $t_k$ is bigger than a certain value $T_k$.
$$ \left[\sum_k\left(t_k \ge T_k\right)\right] \ge N $$
where $N$ is the minimum number of constraints to be satisfied.
Can this problem be solved in MILP and how? I am new to this domain and any leads would be very helpful.