 Consequently, any STI can be proven via linear programming by checking if it is implied by the basic identities and non-negativity constraints.The described algorithm first performs Fourier–Motzkin elimination to remove the auxiliary rates.Then, it imposes the information theoretic non-negativity constraints on the reduced output system and removes redundant inequalities.