min     x1 +  x2 s.t.   3x1 + 2x2 ≥ 36        3x1 + 4x2 ≥ 48         x1, x2 ≥ 0 For the LP problem above, which are the binding constraints?            3x1 + 2x2 ≥ 36     3x1 + 4x2 ≥ 48     x1 ≥ 0     x2 ≥ 0

Use this graph to answer the questions. Max    20X + 10Y s.t.      12X + 15Y ≤ 180            15X + 10Y ≤ 150                3X − 8Y ≤ 0 c.        Which constraints are binding? d.        Which slack variables equal zero? Note:- Do not provide handwritten solution. Maintain accuracy and quality in your answer. Take care of plagiarism. Answer completely. You will get up vote for sure.

3. Determine whether x = T (0 3 0 9 2) is a solution to 3x2 + 2x5 max X1,2,3,4,5 ER subject to x1 + x2x5 x2 + x3 + x5 -2x2 + x4+x5 X1, X2, X3, X4, X5 = = 1 5 5 0 (3)