IEDO chemical manufactures four chemicals: A, B, C, and D. These chemicals are produced via two production processes. Running process 1 for hour costs $7 and yield 3 units of A, 2 units of B, 1 of C, and 1 of D. Running process 2 for an hour costa $3 and produces 1 unit of 1 units of A and 1 of B. To meet customer demands, at least 12 units of A, 6 of B, 4 of C, and 3 of D must be produced daily.

a. Formulate an LP to determine a daily production plan to that minimizes the cost of meeting IEDO Chemicals daily demands.

b. Graphically solve the LP.

Graphically solve the following LP: mins.t.x1x2x1+x26x1x202x1+x26x10,x20. Answer the following questions and briefly explain your answers. (a) True or false: If an LP is unbounded, its feasible region must be unbounded. (b) True or false: If an LP has an unbounded feasible region, it must be unbounded. (c) Multiple choice: If an LP has an optimal solution, there must be at least (zero/one/two) binding constraint(s) at that optimal solution. (d) True or false: If an LP has two optimal solutions, there must be the third optimal solution. Graphically solve the following LP: mins.t.x1x2x1+x26x1x202x1+x26x10,x20. Answer the following questions and briefly explain your answers. (a) True or false: If an LP is unbounded, its feasible region must be unbounded. (b) True or false: If an LP has an unbounded feasible region, it must be unbounded. (c) Multiple choice: If an LP has an optimal solution, there must be at least (zero/one/two) binding constraint(s) at that optimal solution. (d) True or false: If an LP has two optimal solutions, there must be the third optimal solution