4/19/23, 1 1:09 PM LBOMGTS Quiz 3: [1222_LBOMGTS_K46] - PRESCRIPTIVE ANAL YTICS (OPTIMIZA TION)
https://dlsu.instructure.com/courses/1 19651/quizzes/321813 1/26LBOMGTS 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
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.Choose the correct answer . pts Question 1
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 4/19/23, 1 1:09 PM LBOMGTS Quiz 3: [1222_LBOMGTS_K46] - PRESCRIPTIVE ANAL YTICS (OPTIMIZA TION)
https://dlsu.instructure.com/courses/1 19651/quizzes/321813 2/26 True No answer text provided. pts Question 2
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 + 10 x3 + 15 x4
s.t. 5x1 + 7 x2 + 12 x3 + 1 1x4 ≤ 21 {Constraint 1}
x1 + x2 + x3 + x4 ≥ 2 {Constraint 2}
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 pts Question 3
S e n d 4/19/23, 1 1:09 PM LBOMGTS Quiz 3: [1222_LBOMGTS_K46] - PRESCRIPTIVE ANAL YTICS (OPTIMIZA TION)
https://dlsu.instructure.com/courses/1 19651/quizzes/321813 3/26Binary variables are variables whose only possible values are 0 or 1. No answer text provided. True No answer text provided. False pts Question 4
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 pts Question 5
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
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller Wiseman. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $15.49. You're not tied to anything after your purchase.
