This action might not be possible to undo. Are you sure you want to continue?

Question 1

0 out of 2 points

The solution to the LP relaxation of a maximization integer linear program provides an upper bound for the value of the objective function. Answer: Selected Answer: False Correct Answer: True

Question 2

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: Correct Answer: True True

Question 3

2 out of 2 points

If exactly 3 projects are to be selected from a set of 5 projects, this would be written as 3 separate constraints in an integer program. Answer Selected Answer: Correct Answer: False False

Question 4

2 out of 2 points

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

Question 5

2 out of 2 points

In a problem involving capital budgeting applications, the 0-1 variables designate the acceptance or rejection of the different projects. Answer Selected Answer: True

S4. S6.Correct Answer: True Question 6 2 out of 2 points A conditional constraint specifies the conditions under which variables are integers or real variables. project 2 __________ be selected. if the constraint x1-x2 = 0. Answer Selected Answer: Correct Answer: False False Question 7 2 out of 2 points In a __________ integer model. Restriction 3. The restrictions are: Restriction 1. S2. and S7. the constraint for the first restriction is Answer Selected Answer: S1 + S3 + S7 ≤ 2 Correct Answer: S1 + S3 + S7 ≤ 2 Question 9 2 out of 2 points In a 0-1 integer programming model. Assuming that Si is a binary variable. it means when project 1 is selected. at least 3 should be assessed. Restriction 2. Evaluating sites S1 and S3 will prevent you from exploring site S7. S3. Answer Selected Answer: mixed Correct Answer: mixed Question 8 2 out of 2 points You have been asked to select at least 3 out of 7 possible sites for oil exploration. Answer . Designate each site as S1. Evaluating sites S2 or S4 will prevent you from assessing site S5. some solution values for decision variables are integers and others can be non-integer. S5. Of all the sites.

Selected Answer: must also Correct Answer: must also Question 10 2 out of 2 points Binary variables are Answer Selected Answer: 0 or 1 only Correct Answer: 0 or 1 only Question 11 2 out of 2 points If the solution values of a linear program are rounded in order to obtain an integer solution. Because these machines are from different manufacturers and use differing technologies. the solution is Answer Selected Answer: sometimes optimal and feasible Correct Answer: sometimes optimal and feasible Question 12 2 out of 2 points The Wiethoff Company has a contract to produce 10000 garden hoses for a customer. machine 1 will not be used. Answer Selected Answer: Y1 + Y4 ≤ 1 Correct Answer: Y1 + Y4 ≤ 1 . Write a constraint to ensure that if machine 4 is used. Wiethoff has 4 different machines that can produce this kind of hose. their specifications are not the same.

Answer Selected Answer: Y1 + Y2 + Y3+ Y4 ≤ 3 Correct Answer: Y1 + Y2 + Y3+ Y4 ≤ 3 Question 14 2 out of 2 points The solution to the linear programming relaxation of a minimization problem will always be __________ the value of the integer programming minimization problem. Question 13 2 out of 2 points The 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. Answer Selected Answer: corequisite Correct Answer: corequisite Question 16 2 out of 2 points . Write the constraint that indicates they can purchase no more than 3 machines. their specifications are not the same. Because these machines are from different manufacturers and use differing technologies. Answer Selected Answer: less than or equal to Correct Answer: less than or equal to Question 15 2 out of 2 points If we are solving a 0-1 integer programming problem. the constraint x1 = x2 is a __________ constraint.

If we are solving a 0-1 integer programming problem. (For example. 50) means that x1 = 10. x2 = 20. the constraint x1 ≤ x2 is a __________ constraint. the expression (10. 6. z). and z = 50). x2 ≥ 0 and integer Find the optimal solution. Answer Selected Answer: multiple choice Correct Answer: multiple choice Question 19 0 out of 2 points Max Z = 3x1 + 5x2 Subject to: 7x1 + 12x2 ≤ 136 3x1 + 5x2 ≤ 36 x1. 6. 36 . x2. the constraint x1 + x2 ≤ 1 is a __________ constraint. the constraint x1 + x2 = 1 is a __________ constraint. 20. Answer Selected Answer: (2. 36) Correct Answer: 2. Write your answer in the form : ( x1. Answer Selected Answer: conditional Correct Answer: conditional Question 17 2 out of 2 points If we are solving a 0-1 integer programming problem. Answer Selected Answer: mutually exclusive Correct Answer: mutually exclusive Question 18 2 out of 2 points If we are solving a 0-1 integer programming problem.

x2 = 20. Question 20 0 out of 2 points Consider the following integer linear programming problem Max Z = 3x1 + 2x2 Subject to: 3x1 + 5x2 ≤ 30 5x1 + 2x2 ≤ 28 x1 ≤ 8 x1 . 3. 18) Correct Answer: 4. the expression (10. and z = 50). 50) means that x1 = 10. 18 Sunday. x2. 20. z). Answer Selected Answer: (4. 3. June 3. 2012 3:36:51 PM EDT .x2 ≥ 0 and integer What is the optimal solution? Write your answer in the form : ( x1. (For example.

Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

We've moved you to where you read on your other device.

Get the full title to continue

Get the full title to continue reading from where you left off, or restart the preview.

scribd