AGEC 3413 (LSU) – Test 3 | Real Questions
with Accurate, A+ Graded Answer
You have been asked to select at least 3 out of 7 possible sites for oil exploration. Designate each site as
S1, S2, S3, S4, S5, S6, and S7. The restrictions are:
Restriction 1. Evaluating sites S1 and S3 will prevent you from exploring site S7.
Restriction 2. Evaluating sites S2 or S4 will prevent you from assessing site S5.
Restriction 3. Of all the sites, at least 3 should be assessed.
Assuming that Si is a binary variable, the constraint for the first restriction is :
A) S1 + S3 + S7 ≥ 1.
B) S1 + S3 + S7 ≤1.
C) S1 + S3 + S7 = 2.
D) S1 + S3 + S7 ≤ 2. - ✔✔D) S1 + S3 + S7 ≤ 2.
Max Z = 5x1 + 6x2
Subject to: 17x1 + 8x2 ≤ 136
3x1 + 4x2 ≤ 36
x1, x2 ≥ 0 and integer
What is the optimal solution?
A) x1 = 6, x2 = 4, Z = 54
B) x1 = 3, x2 = 6, Z = 51
C) x1 = 2, x2 = 6, Z = 46
D) x1 = 4, x2 = 6, Z = 56 - ✔✔D) x1 = 4, x2 = 6, Z = 56
Assume that we are using 0-1 integer programming model to solve a capital budgeting problem and xj =
1 if project j is selected and xj = 0, otherwise.
,The constraint (x1 + x2 + x3 + x4 = 2) means that ________ out of the ________ projects must be
selected.
A) exactly 1, 2
B) exactly 2, 4
C) at least 2, 4
D) at most 1, 2 - ✔✔B) exactly 2, 4
In a 0-1 integer programming model, if the constraint x1 - x2 = 0, it means when project 1 is selected,
project 2 ________ be selected.
A) can also
B) can sometimes
C) can never
D) must also - ✔✔Answer: D
In a 0-1 integer programming model, if the constraint x1 - x2 ≤ 0, it means when project 2 is selected,
project 1 ________ be selected.
A) must always
B) can sometimes
C) can never
D) is already - ✔✔B) can sometimes
In formulating a mixed integer programming problem, the constraint x1 + x2 ≤ 500y1 where y1 is a 0-1
variable and x1 and x2 are continuous variables, then x1 + x2 = 500 if y1 is:
A) 0.
B) 1.
C) 0 or 1.
D) none of the above - ✔✔B) 1.
, In a transportation problem, items are allocated from sources to destinations at a minimum cost. -
✔✔True
In a transportation problem, items are allocated from sources to destinations at a maximum value. -
✔✔False
The linear programming model for a transportation problem has constraints for supply at each source
and demand at each destination - ✔✔True
In a balanced transportation model where supply equals demand, all constraints are equalities -
✔✔True
In an unbalanced transportation model, all constraints are equalities - ✔✔False
For most real-world applications, an unbalanced transportation model is a more likely occurrence than a
balanced transportation model - ✔✔True
In order to model a "prohibited route" in a transportation or transshipment problem, the route should
be omitted from the linear program - ✔✔False
A prohibited route in a transportation model should be assigned a value of zero. - ✔✔False
A prohibited route in a transportation model should be assigned an arbitrarily high cost coefficient. -
✔✔True
In an unbalanced transportation problem, if demand exceeds supply, the optimal solution will be
infeasible. - ✔✔False
The transshipment model includes intermediate points between the sources and destinations - ✔✔True
with Accurate, A+ Graded Answer
You have been asked to select at least 3 out of 7 possible sites for oil exploration. Designate each site as
S1, S2, S3, S4, S5, S6, and S7. The restrictions are:
Restriction 1. Evaluating sites S1 and S3 will prevent you from exploring site S7.
Restriction 2. Evaluating sites S2 or S4 will prevent you from assessing site S5.
Restriction 3. Of all the sites, at least 3 should be assessed.
Assuming that Si is a binary variable, the constraint for the first restriction is :
A) S1 + S3 + S7 ≥ 1.
B) S1 + S3 + S7 ≤1.
C) S1 + S3 + S7 = 2.
D) S1 + S3 + S7 ≤ 2. - ✔✔D) S1 + S3 + S7 ≤ 2.
Max Z = 5x1 + 6x2
Subject to: 17x1 + 8x2 ≤ 136
3x1 + 4x2 ≤ 36
x1, x2 ≥ 0 and integer
What is the optimal solution?
A) x1 = 6, x2 = 4, Z = 54
B) x1 = 3, x2 = 6, Z = 51
C) x1 = 2, x2 = 6, Z = 46
D) x1 = 4, x2 = 6, Z = 56 - ✔✔D) x1 = 4, x2 = 6, Z = 56
Assume that we are using 0-1 integer programming model to solve a capital budgeting problem and xj =
1 if project j is selected and xj = 0, otherwise.
,The constraint (x1 + x2 + x3 + x4 = 2) means that ________ out of the ________ projects must be
selected.
A) exactly 1, 2
B) exactly 2, 4
C) at least 2, 4
D) at most 1, 2 - ✔✔B) exactly 2, 4
In a 0-1 integer programming model, if the constraint x1 - x2 = 0, it means when project 1 is selected,
project 2 ________ be selected.
A) can also
B) can sometimes
C) can never
D) must also - ✔✔Answer: D
In a 0-1 integer programming model, if the constraint x1 - x2 ≤ 0, it means when project 2 is selected,
project 1 ________ be selected.
A) must always
B) can sometimes
C) can never
D) is already - ✔✔B) can sometimes
In formulating a mixed integer programming problem, the constraint x1 + x2 ≤ 500y1 where y1 is a 0-1
variable and x1 and x2 are continuous variables, then x1 + x2 = 500 if y1 is:
A) 0.
B) 1.
C) 0 or 1.
D) none of the above - ✔✔B) 1.
, In a transportation problem, items are allocated from sources to destinations at a minimum cost. -
✔✔True
In a transportation problem, items are allocated from sources to destinations at a maximum value. -
✔✔False
The linear programming model for a transportation problem has constraints for supply at each source
and demand at each destination - ✔✔True
In a balanced transportation model where supply equals demand, all constraints are equalities -
✔✔True
In an unbalanced transportation model, all constraints are equalities - ✔✔False
For most real-world applications, an unbalanced transportation model is a more likely occurrence than a
balanced transportation model - ✔✔True
In order to model a "prohibited route" in a transportation or transshipment problem, the route should
be omitted from the linear program - ✔✔False
A prohibited route in a transportation model should be assigned a value of zero. - ✔✔False
A prohibited route in a transportation model should be assigned an arbitrarily high cost coefficient. -
✔✔True
In an unbalanced transportation problem, if demand exceeds supply, the optimal solution will be
infeasible. - ✔✔False
The transshipment model includes intermediate points between the sources and destinations - ✔✔True
