Multiple Choice
The following linear programming problem has been written to plan the production of two products.The company wants to maximize its profits.
X1 = number of product 1 produced in each batch X2 = number of product 2 produced in each batch
MAX: 150 X1 + 250 X2
Subject to: 2 X1 + 5 X2 ≤ 200 − resource 1
3 X1 + 7 X2 ≤ 175 − resource 2 X1,X2 ≥ 0
How many units of resource 1 are consumed by each unit of product 1 produced?
A) 1
B) 2
C) 3
D) 5
Correct Answer:

Verified
Correct Answer:
Verified
Q13: A diet is being developed which must
Q17: Bob and Dora Sweet wish to start
Q18: Solve the following LP problem graphically using
Q19: The following linear programming problem has been
Q25: The Byte computer company produces two
Q26: This graph shows the feasible region defined
Q27: The following diagram shows the constraints for
Q28: If a problem has infinite number solutions,
Q57: The constraints of an LP model define
Q74: The second step in formulating a linear