Multiple Choice
Write the resource constraints for this situation: Kim and Lynn produce tables (x) and chairs (y) . Each piece is assembled, sanded, and stained. A table requires two hours to assemble, three hours to sand, and three hours to stain. A chair requires four hours to assemble, two hours to sand, and three hours to stain. The profit earned on each table is $20 and on each chair is $12. Together Kim and Lynn spend at most 16 hours assembling, 10 hours sanding, and 13 hours staining.
A) 2x + 4y 16, 3 x + 2y 10, 3x + 3y 13, x 0, y 0
B) 2x + 3y + 3z 20, 4x + 2y + 3z 12, x 0, y 0, z 0
C) 16x + 10y + 13z 0, 2x + 3y + 3z 20, 4x + 2y + 3z 12, x 0, y 0, z 0
D) 8x + 4y 16, (10/3) x + 5y 10, (13/3) x + (13/3) y 13, x 0, y 0
Correct Answer:

Verified
Correct Answer:
Verified
Q59: Find the constraint inequalities and the profit
Q60: The graph of the feasible region for
Q61: The graph of the feasible region for
Q62: What type of solution does the Northwest
Q63: Find the point of intersection for the
Q65: An optimal solution for a linear programming
Q66: The feasible region for a linear programming
Q67: Given below is the sketch of the
Q68: Suppose the feasible region has five corners,
Q69: The feasible region for a linear programming