Question

A linear programming problem has three constraints:

2X + 10Y u2264 1004X + 6Y u2264 1206X + 3Y u2265 90

What is the largest quantity of X that can be made without violating any of these constraints?

A) 50

B) 30

C) 20

D) 15

E) 10

Answer

This answer is hidden. It contains 1 characters.