I have a constraint of the form
If z = 1 then a^T x - b >= 0
where x is a binary vector [x_1, x_2, ..., x_n]^T of size n where x_i is in {0, 1} for all i. The vector a = [a_1, a_2, ..., a_n]^T and b = [b_1, b_2, ..., b_n]^T are real-valued vector given as inputs.
Is there anyway to write this in Gurobi without using big M formulation (maybe using SOS constraints)?