4/19/23, 11:09 PM LBOMGTS Quiz 3: [1222_LBOMGTS_K46] - PRESCRIPTIVE ANALYTICS (OPTIMIZATION)
LBOMGTS Quiz 3
Due Apr 18 at 6:30pm Points 50 Questions 34
Available Apr 15 at 9am - Apr 18 at 7:05pm Time Limit 120 Minutes
Instructions
Choose the correct answer.
This quiz was locked Apr 18 at 7:05pm.
Attempt History
Attempt Time Score
LATEST Attempt 1 44 minutes 48 out of 50
Correct answers are hidden.
Score for this quiz: 48 out of 50
Submitted Apr 15 at 4:03pm
This attempt took 44 minutes.
Question 1 pts
Binary integer programming problems are those where all the decision
variables restricted to integer values are further restricted to be binary
variables.
No answer text provided.
False
Course Chat
https://dlsu.instructure.com/courses/119651/quizzes/321813 1/26
,4/19/23, 11:09 PM LBOMGTS Quiz 3: [1222_LBOMGTS_K46] - PRESCRIPTIVE ANALYTICS (OPTIMIZATION)
True
No answer text provided.
Question 2 pts
A firm has prepared the following binary integer program to evaluate a
number of potential locations for new warehouses. The firm's goal is to
maximize the net present value of their decision while not spending more
than their currently available capital.
Max 20x1 + 30x2 + 10x3 + 15x4
s.t. 5x1 + 7x2 + 12x3 + 11x4 ≤ 21 {Constraint 1}
x1 + x2 + x3 + x4 ≥ 2 {Constraint 2}
Send
x1 + x2 ≤ 1 {Constraint 3}
x1 + x3 ≥ 1 {Constraint 4}
x2 = x4 {Constraint 5}
Which of the constraints enforces a contingent relationship?
Constraint 5
Constraint 2
Constraint 3
Constraint 4
Question 3 pts
https://dlsu.instructure.com/courses/119651/quizzes/321813 2/26
, 4/19/23, 11:09 PM LBOMGTS Quiz 3: [1222_LBOMGTS_K46] - PRESCRIPTIVE ANALYTICS (OPTIMIZATION)
Binary variables are variables whose only possible values are 0 or 1.
No answer text provided.
True
No answer text provided.
False
Question 4 pts
Binary variables are best suited to be the decision variables when dealing
with yes-or-no decisions.
No answer text provided.
False
No answer text provided.
True
Question 5 pts
If a firm wishes to choose at most 2 of 4 possible activities (A, B, C and
D), the constraint xA + xB + xC + xD ≥ 2 will enforce this relationship in a
https://dlsu.instructure.com/courses/119651/quizzes/321813 3/26
LBOMGTS Quiz 3
Due Apr 18 at 6:30pm Points 50 Questions 34
Available Apr 15 at 9am - Apr 18 at 7:05pm Time Limit 120 Minutes
Instructions
Choose the correct answer.
This quiz was locked Apr 18 at 7:05pm.
Attempt History
Attempt Time Score
LATEST Attempt 1 44 minutes 48 out of 50
Correct answers are hidden.
Score for this quiz: 48 out of 50
Submitted Apr 15 at 4:03pm
This attempt took 44 minutes.
Question 1 pts
Binary integer programming problems are those where all the decision
variables restricted to integer values are further restricted to be binary
variables.
No answer text provided.
False
Course Chat
https://dlsu.instructure.com/courses/119651/quizzes/321813 1/26
,4/19/23, 11:09 PM LBOMGTS Quiz 3: [1222_LBOMGTS_K46] - PRESCRIPTIVE ANALYTICS (OPTIMIZATION)
True
No answer text provided.
Question 2 pts
A firm has prepared the following binary integer program to evaluate a
number of potential locations for new warehouses. The firm's goal is to
maximize the net present value of their decision while not spending more
than their currently available capital.
Max 20x1 + 30x2 + 10x3 + 15x4
s.t. 5x1 + 7x2 + 12x3 + 11x4 ≤ 21 {Constraint 1}
x1 + x2 + x3 + x4 ≥ 2 {Constraint 2}
Send
x1 + x2 ≤ 1 {Constraint 3}
x1 + x3 ≥ 1 {Constraint 4}
x2 = x4 {Constraint 5}
Which of the constraints enforces a contingent relationship?
Constraint 5
Constraint 2
Constraint 3
Constraint 4
Question 3 pts
https://dlsu.instructure.com/courses/119651/quizzes/321813 2/26
, 4/19/23, 11:09 PM LBOMGTS Quiz 3: [1222_LBOMGTS_K46] - PRESCRIPTIVE ANALYTICS (OPTIMIZATION)
Binary variables are variables whose only possible values are 0 or 1.
No answer text provided.
True
No answer text provided.
False
Question 4 pts
Binary variables are best suited to be the decision variables when dealing
with yes-or-no decisions.
No answer text provided.
False
No answer text provided.
True
Question 5 pts
If a firm wishes to choose at most 2 of 4 possible activities (A, B, C and
D), the constraint xA + xB + xC + xD ≥ 2 will enforce this relationship in a
https://dlsu.instructure.com/courses/119651/quizzes/321813 3/26
