Table 10-5
Maximize Z = 34 X 1 + 43 X 2 + 29 X 3
Subject to: 5 X 1 + 4 X 2 + 7 X 3 ≤ 50
1 X 1 + 2 X 2 + 2 X 3 ≤ 16
3 X 1 + 4 X 2 + 1 X 3 ≤ 9
all X i are integer and non-negative
Final Integer Solution: Z = 208
Decision
Variable Solution
X 1 1
X 2 0
X 3 6
-Table 10-5 represents a solution for an integer programming problem.If one uses the optimal solution presented,how much slack is there in the first equation?
A)0 units
B)5 units
C)3 units
D)2 units
E)None of the above

Question

Table 10-5
Maximize Z = 34 X 1 + 43 X 2 + 29 X 3 
Subject to: 5 X 1 + 4 X 2 + 7 X 3 ≤ 50
1 X 1 + 2 X 2 + 2 X 3 ≤ 16
3 X 1 + 4 X 2 + 1 X 3 ≤ 9
all X i are integer and non-negative
Final Integer Solution: Z = 208
Decision
Variable Solution
X 1 1
X 2 0
X 3 6
-Table 10-5 represents a solution for an integer programming problem.If one uses the optimal solution presented,how much slack is there in the first equation?
A)0 units
B)5 units
C)3 units
D)2 units
E)None of the above

Quizplus · Accepted Answer

The Answer of Table 10-5
Maximize Z = 34 X 1 + 43 X 2 + 29 X 3 
Subject to: 5 X 1 + 4 X 2 + 7 X 3 ≤ 50
1 X 1 + 2 X 2 + 2 X 3 ≤ 16
3 X 1 + 4 X 2 + 1 X 3 ≤ 9
all X i are integer and non-negative
Final Integer Solution: Z = 208
Decision
Variable Solution
X 1 1
X 2 0
X 3 6
-Table 10-5 represents a solution for an integer programming problem.If one uses the optimal solution presented,how much slack is there in the first equation?
A)0 units
B)5 units
C)3 units
D)2 units
E)None of the above

Table 10-5 Maximize Z = 34 X1 + 43 X2 + 29

Table 10-5 Maximize Z = 34 X₁ + 43 X₂ + 29