Question: Consider the following linear programming problem Max 5X1 + 3X2 s.t. 4X1 + 9X2 < 72 Machine 1 10X1 + 10X2 < 100 Machine 2

Consider the following linear programming problem

Max 5X1 + 3X2

s.t. 4X1 + 9X2 < 72 Machine 1

10X1 + 10X2 < 100 Machine 2

20X1 < 120 Machine 3

X1, X2 > 0

Answer the following multiple choice questions based on the below Excel output.

1. What is the optimal value of the Objective Function?

a. 6

b. 4.

c. 60

d. 42

2. Which constraints were Binding?

Machines 1 and 2

Machines 1 and 3

None of the Machines were binding

Machines 2 and 3

3. How many hours of Machine 1 were actually used?

60 hours

12 hours

72 hours

42 hours

4. Which machine was Not Binding and how many hours were unused?

Machine 1, 60 hours

Machine 2, 0 hours

Machine 3, 42 hours

None of the machines were Not Binding

5.. What is the optimal values for x1 and x2?

a. x1 = 4. X2 = 6

b. x1 = 12, x2 = 60

c. x1 = 42, x2 = 0

d. x1 = 6, x2 = 4

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!