Multiple Choice
Table 10-5
Maximize Z = 34 X1 + 43 X2 + 29 X3
Subject to: 5 X1 + 4 X2 + 7 X3 ≤ 50
1 X1 + 2 X2 + 2 X3 ≤ 16
3 X1 + 4 X2 + 1 X3 ≤ 9
all Xi are integer and non-negative
Final Integer Solution: Z = 208
Decision
Variable Solution
X1 1
X2 0
X3 6
-Table 10-5 represents a solution for an integer programming problem.If this problem had been solved as a simple linear programming problem,what would you expect the value of the objective function to be?
A) less than 208
B) greater than 208
C) exactly 208
D) A or C
E) B or C
Correct Answer:

Verified
Correct Answer:
Verified
Q3: There is no general method for solving
Q54: The constraint X<sub>1</sub> + X<sub>2</sub> ≤ 1
Q62: A type of integer programming is<br>A)pure.<br>B)mixed.<br>C)zero-one.<br>D)All of
Q63: A quadratic programming problem involves which of
Q64: A goal programming problem had two goals
Q66: Another name for a 0-1 variable is
Q68: A goal programming problem had two goals
Q69: An integer programming (maximization)problem was first solved
Q71: Goal programming and linear programming differ in
Q72: According to Table 10-6,how is the constraint