MAT 540 Week 7 Quiz 3 (Three Sets)

MAT 540 Week 7 Quiz 3 Set 1 QUESTIONS Question 1: Graphical solutions to linear programming problems have an infinite number of possible objective function lines.  Question 2: The following inequality represents a resource constraint for a maximization problem:                                                                  X + Y ≥ 20  Question 3: In minimization LP problems the feasible region is always below the resource constraints.  Question 4: In a linear programming problem, all model parameters are assumed to be known with certainty.  Question 5: A feasible solution violates at least one of the constraints.  Question 6: If the objective function is parallel to a constraint, the constraint is infeasible. Question 7: If the objective function is parallel to a constraint, the constraint is infeasible. Question 8: Cully furniture buys 2 products for resale: big shelves (B) and medium shelves (M). Each    big shelf costs $500 and requires 100 cubic feet of storage space, and each medium shelf costs $300 and requires 90 cubic feet of storage space. The company has $75000 to invest in shelves this week, and the warehouse has 18000 cubic feet available for storage. Profit for each big shelf is $300 and for each medium shelf is $150. What is the maximum profit? Question 9: The following is a graph of a linear programming problem. The feasible solution space is shaded, and the optimal solution is at the point labeled Z*.   Which of the following points are not feasible? Question 10: The production manager for the Coory soft drink company is considering the production of 2 kinds of soft drinks: regular (R) and diet(D). Two of the limited resources are production time (8 hours = 480 minutes per day) and syrup limited to 675 gallons per day. To produce a regular case requires 2 minutes and 5 gallons of syrup, while a diet case needs 4 minutes and 3 gallons of syrup. Profits for regular soft drink are $3.00 per case and profits for diet soft drink are $2.00 per case. What is the time constraint? Question 11: The following is a graph of a linear programming problem. The feasible solution space is shaded, and the optimal solution is at the point labeled Z*.  The equation for constraint DH is: Question 12: Which of the following statements is not true? Question 13: In a linear programming problem, a valid objective function can be represented as Question 14: The linear programming problem: MIN Z =          2×1 + 3×2  Subject to:       x1 + 2×2 ≤ 20                          5×1 + x2 ≤ 40                          4×1 +6×2 ≤ 60                          x1 , x2 ≥ 0 , Question 15: The following is a graph of a linear programming problem. The feasible solution space is shaded, and the optimal solution is at the point labeled Z*.  This linear programming problem is a: Question 16: A graphical representation of a linear program is shown below. The shaded area represents the feasible region, and the dashed line in the middle is the slope of the objective function. If this is maximization, which extreme point is the optimal solution? Question 17: Which of the following could be a linear programming objective function? Question 18: Solve the following graphically Max z =     3×1 +4×2  s.t.             x1 + 2×2 ≤ 16                    2×1 + 3×2 ≤ 18                    x1    ≥ 2                     x2    ≤ 10                   x1, x2 ≥ 0 Find 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 25 Question 19: Consider the following linear programming problem:  Max Z =           $15x + $20y  Subject to:       8x + 5y ≤ 40                          0.4x + y ≥ 4                          x, y ≥ 0  At the optimal solution, what is the amount of slack associated with the first constraint?  Question 20: Max Z =    $3x + $9y  Subject to:       20x + 32y ≤ 1600                          4x + 2y ≤ 240                          y ≤ 40                          x, y ≥ 0  At the optimal solution, what is the amount of slack associated with the second constraint?   MAT 540 Week 7 Quiz 3 Set 2 QUESTIONS  Question 1: A linear programming problem may have more than one set of solutions. Question 2: A feasible solution violates at least one of the constraints.  Question 3: Graphical solutions to linear programming problems have an infinite number of possible  objective function lines.   Question 4: In a linear programming problem, all model parameters are assumed to be known with certainty. Question 5: Surplus variables are only associated with minimization problems. Question 6: A linear programming model consists of only decision variables and constraints. Question 7: If the objective function is parallel to a constraint, the constraint is infeasible. Question 8: Cully furniture buys 2 products for resale: big shelves (B) and medium shelves (M). Each big shelf costs $500 and requires 100 cubic feet of storage space, and each medium shelf costs $300 and requires 90 cubic feet of storage space. The company has $75000 to invest in shelves this week, and the warehouse has 18000 cubic feet available for storage. Profit for each big shelf is $300 and for each medium shelf is $150. What is the maximum profit? Question 9: The following is a graph of a linear programming problem. The feasible solution space is shaded, and the optimal solution is at the point labeled Z*.  This linear programming problem is a: Question 10: Decision variables Question 11: The following is a graph of a linear programming problem. The feasible solution space is shaded, and the optimal solution is at the point labeled Z*.  Which of the following points are not feasible? Question 12: Cully furniture buys 2 products for resale: big shelves (B) and medium shelves (M). Each big shelf costs $500 and requires 100 cubic feet of storage space, and each medium shelf costs $300 and requires 90 cubic feet of storage space. The company has $75000 to invest in shelves this week, and the warehouse has 18000 cubic feet available for storage. Profit for each big shelf is $300 and for each medium shelf is $150. What is the objective function? Question 13: The following is a graph of a linear programming problem. The feasible solution space is shaded, and the optimal solution is at the point labeled Z*.  The equation for constraint DH is: Question 14: The following is a graph of a linear programming problem. The feasible solution space is shaded, and the optimal solution is at the point labeled Z*. Which of the following constraints has a surplus greater than 0? Question 15: A graphical representation of a linear program is shown below. The shaded area represents the feasible region, and the dashed line in the middle is the slope of the objective function.  If this is maximization, which extreme point is the optimal solution? Question 16: The production manager for the Coory soft drink company is considering the production of 2 kinds of soft drinks: regular (R) and diet (D). Two of her limited resources are production time (8 hours = 480 minutes per day) and syrup (1 of her ingredients) limited to 675 gallons per day. To produce a regular case requires 2 minutes and 5 gallons of syrup, while a diet case needs 4 minutes and 3 gallons of syrup. Profits for regular soft drink are $3.00 per case and profits for diet soft drink are $2.00 per case. What is the objective function? Question 17: Which of the following could be a linear programming objective function? Question 18: A graphical representation of a linear program is shown below. The shaded area represents the feasible region, and the dashed line in the middle is the slope of the objective function. What would be the new slope of the objective function if multiple optimal solutions occurred along line segment AB? Write your answer in decimal notation. Question 19: Max Z =    $3x + $9y  Subject to:       20x + 32y ≤ 1600                          4x + 2y ≤ 240                          y ≤ 40                          x, y ≥ 0  At the optimal solution, what is the amount of slack associated with the second constraint? Question 20: Solve the following graphically Max z =     3×1 +4×2  s.t.             x1 + 2×2 ≤ 16                    2×1 + 3×2 ≤ 18                    x1    ≥ 2                     x2    ≤ 10                   x1, x2 ≥ 0   Find 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 25 MAT 540 Week 7 Quiz 3 Set 3 QUESTIONS Question 1: A feasible solution violates at least one of the constraints. Question 2: A linear programming model consists of only decision variables and constraints.   Question 3: If the objective function is parallel to a constraint, the constraint is infeasible. Question 4: In minimization LP problems the feasible region is always below the resource constraints. Question 5: Surplus variables are only associated with minimization problems. Question 6: If the objective function is parallel to a constraint, the constraint is infeasible. Question 7: A linear programming problem may have more than one set of solutions. Question 8: The production manager for the Coory soft drink company is considering the production of 2 kinds of soft drinks: regular (R) and diet(D). Two of the limited resources are production time (8 hours = 480 minutes per day) and syrup limited to 675 gallons per day. To produce a regular case requires 2 minutes and 5 gallons of syrup, while a diet case needs 4 minutes and 3 gallons of syrup. Profits for regular soft drink are $3.00 per case and profits for diet soft drink are $2.00 per case. What is the time constraint? Question 9: The production manager for the Coory soft drink company is considering the production of 2 kinds of soft drinks: regular and diet. Two of her limited resources are production time (8 hours = 480 minutes per day) and syrup (1 of her ingredients) limited to 675 gallons per day. To produce a regular case requires 2 minutes and 5 gallons of syrup, while a diet case needs 4 minutes and 3 gallons of syrup. Profits for regular soft drink are $3.00 per case and profits for diet soft drink are $2.00 per case. For the production combination of 135 cases of regular and 0 cases of diet soft drink, which resources will not be completely used? Question 10: In a linear programming problem, the binding constraints for the optimal solution are:              5×1 + 3×2 ≤ 30              2×1 + 5×2 ≤ 20  Which of these objective functions will lead to the same optimal solution? Question 11: Which of the following statements is not true? Question 12: The production manager for the Coory soft drink company is considering the production of 2 kinds of soft drinks: regular (R) and diet (D). Two of her limited resources are production time (8 hours = 480 minutes per day) and syrup (1 of her ingredients) limited to 675 gallons per day. To produce a regular case requires 2 minutes and 5 gallons of syrup, while a diet case needs 4 minutes and 3 gallons of syrup. Profits for regular soft drink are $3.00 per case and profits for diet soft drink are $2.00 per case. What is the objective function? Question 13: The following is a graph of a linear programming problem. The feasible solution space is shaded, and the optimal solution is at the point labeled Z*.  Which of the following points are not feasible? Question 14: Decision variables Question 15: Cully furniture buys 2 products for resale: big shelves (B) and medium shelves (M). Each big shelf costs $500 and requires 100 cubic feet of storage space, and each medium shelf costs $300 and requires 90 cubic feet of storage space. The company has $75000 to invest in shelves this week, and the warehouse has 18000 cubic feet available for storage. Profit for each big shelf is $300 and for each medium shelf is $150. What is the objective function? Question 16: Which of the following could be a linear programming objective function? Question 17: The following is a graph of a linear programming problem. The feasible solution space is shaded, and the optimal solution is at the point labeled Z*.  Which of the following constraints has a surplus greater than 0? Question 18: A graphical representation of a linear program is shown below. The shaded area represents the feasible region, and the dashed line in the middle is the slope of the objective function. What would be the new slope of the objective function if multiple optimal solutions occurred along line segment AB? Write your answer in decimal notation. Question 19: Consider the following linear programming problem:  Max Z =           $15x + $20y  Subject to:       8x + 5y ≤ 40                          0.4x + y ≥ 4                          x, y ≥ 0  At the optimal solution, what is the amount of slack associated with the first constraint? Question 20: Consider the following minimization problem:  Min z =     x1 + 2×2  s.t.             x1 + x2 ≥ 300                    2×1 + x2 ≥ 400                    2×1 + 5×2 ≤ 750                    x1, x2 ≥ 0    Find 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 25

Previous answers to this question


This is a preview of an assignment submitted on our website by a student. If you need help with this question or any assignment help, click on the order button below and get started. We guarantee authentic, quality, 100% plagiarism free work or your money back.

order uk best essays Get The Answer
Uncategorized

Leave a Reply

Your email address will not be published. Required fields are marked *