Yaster Wood has two plants that produce lumber used in manufacturing tables and chairs. In 1 day of operation, plant A can produce the lumber required to manufacture 24 tables and 59 chairs, while...

Question attached to the screenshot below thanks$$$$##

Extracted text: Yaster Wood has two plants that produce lumber used in manufacturing tables and chairs. In 1 day of operation, plant A can produce the lumber required to manufacture 24 tables and 59 chairs, while plant B can produce the lumber required to manufacture 27 tables and 54 chairs. In this production run, the company needs enough lumber to manufacture at least 540 tables and 930 chairs. It costs $935 per day to operate plant A and $980 per day to operate plant B. The company needs to produce sufficient lumber at a minimum cost. This can be set up as a linear programming problem where you minimize the operational cost C. Introduce the decision variables: x = number of days to use plant A y = number of days to use plant B Check all of the problem constraints. Note: The non-negative constraints are not included here. 59a + 54y > 930 24:x + 59y 2 935 O 27x + 24y > 540 27x + 54y < 980="" 24x="" +="" 27y="" 2="" 540="" o="" 54x="" +="" 59y="" 2="">