100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
Mat 540 Quiz 1 $7.49   Add to cart

Exam (elaborations)

Mat 540 Quiz 1

 0 view  0 purchase
  • Course
  • Institution

Mat 540 Quiz 1 Mat540 Quiz 1

Preview 2 out of 8  pages

  • February 16, 2022
  • 8
  • 2021/2022
  • Exam (elaborations)
  • Questions & answers
avatar-seller
 Question 1
2 out of 2 points


In a 0­1 integer programming problem involving a capital budgeting application (where
xj = 1, if project j is selected, xj = 0, otherwise) the constraint x1 ­ x2 ≤ 0 implies that if
project 2 is selected, project 1 can not be selected.

Answer
Selected
Answer: False
Correct Answer:
False




 Question 2
2 out of 2 points


If we are solving a 0­1 integer programming problem with three decision variables, the
constraint x1 + x2 ≤ 1 is a mutually exclusive constraint.

Answer
Selected
Answer: True
Correct Answer:
Tru
e




 Question 3
2 out of 2 points


Rounding non­integer solution values up to the nearest integer value will result in an
infeasible solution to an integer linear programming problem.

Answer
Selected
Answer: False
Correct Answer:
False




 Question 4
2 out of 2 points




This study source was downloaded by 100000840946462 from CourseHero.com on 02-15-2022 12:07:08 GMT -06:00


https://www.coursehero.com/file/10494813/Quiz-5-MAT-540/

, In a mixed integer model, some solution values for decision variables are integer and
others are only 0 or 1.

Answer
Selected
Answer: False
Correct Answer:
False




 Question 5
2 out of 2 points


If we are solving a 0­1 integer programming problem, the constraint x1 ≤ x2 is a
conditional constraint.

Answer
Selected
Answer: True
Correct Answer:
Tru
e




 Question 6
2 out of 2 points


If we are solving a 0­1 integer programming problem with three decision variables, the
constraint x1 + x2 + x3 ≤ 3 is a mutually exclusive constraint.

Answer
Selected
Answer: False
Correct Answer:
False




 Question 7
2 out of 2 points


If we are solving a 0­1 integer programming problem, the constraint x1 = x2 is a
__________ constraint.
Answer




This study source was downloaded by 100000840946462 from CourseHero.com on 02-15-2022 12:07:08 GMT -06:00


https://www.coursehero.com/file/10494813/Quiz-5-MAT-540/

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

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

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

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 solutions. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for $7.49. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

79751 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy study notes for 14 years now

Start selling
$7.49
  • (0)
  Add to cart