Solved

A Linear Programming Problem Has Three Constraints: 2X + 10Y

Question 6

Multiple Choice

A linear programming problem has three constraints: 2X + 10Y ≤ 1004X + 6Y ≤ 1206X + 3Y ≤ 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

Correct Answer:

verifed

Verified

Unlock this answer now
Get Access to more Verified Answers free of charge

Related Questions