Details of this Paper

Strayer Mat540 week 10 quiz

Description

solution


Question

Question;Question 1If we are solving a 0-1 integer programming problem with three decision variables, the constraintx1 +x2 +x3? 3 is a mutually exclusive constraint.AnswerTrueFalse2 points Question 2Rounding non-integer solution values up to the nearest integer value will result in an infeasible solution to an integer linear programming problem.AnswerTrueFalse2 points Question 3The solution to the LP relaxation of a maximization integer linear program provides an upper bound for the value of the objective function.AnswerTrueFalse2 points Question 4If we are solving a 0-1 integer programming problem with three decision variables, the constraintx1 +x2? 1 is a mutually exclusive constraint.AnswerTrueFalse2 points Question 5If we are solving a 0-1 integer programming problem, the constraintx1?x2 is a conditional constraint.AnswerTrueFalse2 points Question 6A conditional constraint specifies the conditions under which variables are integers or real variables.AnswerTrueFalse2 points Question 7In a __________ integer model, some solution values for decision variables are integers and others can be non-integer.Answertotal0 - 1mixedall of the above2 points Question 8Max Z = 5x1 + 6x2Subject to: 17x1 + 8x2? 136 3x1 + 4x2? 36 x1, x2? 0 and integerWhat is the optimal solution?Answerx1 = 6, x2 = 4, Z = 54x1 = 3, x2 = 6, Z = 51x1 = 2, x2 = 6, Z = 46x1 = 4, x2 = 6, Z = 562 points Question 9In a 0-1 integer programming model, if the constraint x1-x2 = 0, it means when project 1 is selected, project 2 __________ be selected.Answercan alsocan sometimescan nevermust also2 points Question 10Binary variables areAnswer0 or 1 onlyany integer valueany continuous valueany negative integer value2 points Question 11The 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.Write the constraint that indicates they can purchase no more than 3 machines.AnswerY1 + Y2 + Y3+ Y4? 3Y1 + Y2 + Y3+ Y4 = 3Y1 + Y2 + Y3+ Y4?3none of the above2 points Question 12Assume 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.Answerexactly 2at least 2at most 2none of the above2 points Question 13If we are solving a 0-1 integer programming problem, the constraintx1 +x2? 1 is a __________ constraint.Answermultiple choicemutually exclusiveconditionalcorequisite2 points Question 14In a capital budgeting problem, if either project 1 or project 2 is selected, then project 5 cannot be selected. Which of the alternatives listed below correctly models this situation?Answerx1 + x2 + x5? 1x1 + x2 + x5?1x1 + x5? 1, x2 + x5? 1x1 - x5? 1, x2 - x5? 12 points Question 15You 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 andS3 will prevent you from exploring site S7. Restriction 2. Evaluating sites S2orS4 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 isAnswerS1 + S3 + S7? 1S1 + S3 + S7?1S1 + S3 + S7 = 2S1 + S3 + S7? 22 points Question 16In a 0-1 integer programming model, if the constraint x1-x2? 0, it means when project 2 is selected, project 1 __________ be selected.Answermust alwayscan sometimescan neverA and B2 points Question 17If we are solving a 0-1 integer programming problem, the constraintx1?x2 is a __________ constraint.Answermultiple choicemutually exclusiveconditionalcorequisite2 points Question 18If we are solving a 0-1 integer programming problem, the constraintx1 =x2 is a __________ constraint.Answermultiple choicemutually exclusiveconditionalcorequisite2 points Question 19Consider the following integer linear programming problemMax Z = 3x1 + 2x2Subject to: 3x1 + 5x2? 30 4x1 + 2x2? 28 x1? 8 x1, x2? 0 and integerFind the optimal solution.What is the value of the objective function at the optimal solution.Note: The answer will be an integer.Please give your answer as an integer without any decimal point.For example, 25.0 (twenty-five) would be written 25Answer2 points Question 20Max Z = 3x1 + 5x2Subject to: 7x1 + 12x2? 136 3x1 + 5x2? 36 x1, x2? 0 and integerFind the optimal solution.What is the value of the objective function at the optimal solution.Note: The answer will be an integer.Please give your answer as an integer without any decimal point.For example, 25.0 (twenty-five) would be written 25Answer

 

Paper#60572 | Written in 18-Jul-2015

Price : $27
SiteLock