Which of the following could not be a linear programming problem constraint? question 13 options: 1) a + b ≤ -3 2) a - b ≤ -3 3) a - b ≤ 3 4) -a + b ≤ -3

Match the following reasons with the statements given to create the proof. 1. do = ob, ao = oc sas 2. doc = aob given 3. triangle cod congruent to triangle aob vertical angles are equal. 4. 1 = 2, ab = dc if two sides = and ||, then a parallelogram. 5. ab||dc if alternate interior angles =, then lines parallel. 6. abcd is a parallelogram cpcte