• Shuffle
    Toggle On
    Toggle Off
  • Alphabetize
    Toggle On
    Toggle Off
  • Front First
    Toggle On
    Toggle Off
  • Both Sides
    Toggle On
    Toggle Off
  • Read
    Toggle On
    Toggle Off
Reading...
Front

Card Range To Study

through

image

Play button

image

Play button

image

Progress

1/3

Click to flip

Use LEFT and RIGHT arrow keys to navigate between flashcards;

Use UP and DOWN arrow keys to flip the card;

H to show hint;

A reads text to speech;

3 Cards in this Set

  • Front
  • Back
MAT 540 Quiz 5 Answers Strayer Spring 2013
Download answer at https://www.examtutorials.com/course/mat-540-quiz-5-answers-strayer-spring-2013/
If we are solving a 0-1 integer programming problem, the constraint <i>x</i>1 ≤ <i>x</i>2 is a conditional constraint.In a mixed integer model, some solution values for decision variables are integer and others are only 0 or 1.The solution to the LP relaxation of a maximization integer linear program provides an upper bound for the value of the objective function.If we are solving a 0-1 integer programming problem with three decision variables, the constraint <i>x</i>1 + <i>x</i>2 ≤ 1 is a mutually exclusive constraint.Rounding non-integer solution values up to the nearest integer value will result in an infeasible solution to an integer linear programming problem.If we are solving a 0-1 integer programming problem with three decision variables, the constraint <i>x</i>1 + <i>x</i>2 + <i>x</i>3 ≤ 3 is a mutually exclusive constraint.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 <i>and </i>S3 will prevent you from exploring site S7.Restriction 2. Evaluating sites S2 <i>or</i>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 isAssume 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 4 projects must be selected.If we are solving a 0-1 integer programming problem, the constraint <i>x</i>1 + <i>x</i>2 ≤ 1 is a __________ constraint.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 <i>and </i>S3 will prevent you from exploring site S7.Restriction 2. Evaluating sites S2 <i>or</i>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, write the constraint(s) for the second restrictionThe Wiethoff Company has a contract to produce 10000 garden hoses for a customer. Wiethoff has 4 different machines that can produce this kind of hose. Because these machines are from different manufacturers and use differing technologies, their specifications are not the same.If we are solving a 0-1 integer programming problem, the constraint <i>x</i>1 + <i>x</i>2 = 1 is a __________ constraint.In a __________ integer model, some solution values for decision variables are integers and others can be non-integer.
https://www.examtutorials.com/course/mat-540-quiz-5-answers-strayer-spring-2013/
About ExamTutorials?
Examtutorials.com is a commerical website helps the students in assignment solutions.
Why you choose Examtutorials.com?
High Quality, Fresh Online Study and more