MAT 540 WEEK 7 QUIZ 3
Query 1 In a linear programming drawback, all mannequin parameters are assumed to be identified with certainty. Reply True False Query 2 Graphical options to linear programming issues have an infinite variety of attainable goal perform traces. Reply True False Query three In minimization LP issues the possible area is all the time under the useful resource constraints. Reply True False Query four Surplus variables are solely related to minimization issues. Reply True False Query 5 If the target perform is parallel to a constraint, the constraint is infeasible. Reply True False Query 6 A linear programming mannequin consists of solely determination variables and constraints. Reply True False Query 7 A possible answer violates not less than one of many constraints. Reply True False Query eight The next is a graph of a linear programming drawback. The possible answer area is shaded, and the optimum answer is on the level labeledZ*. (graph didn't copy/paste) Which of the next constraints has a surplus higher than zero? Reply BF CG DH AJ Query 9 Cully furnishings buys 2 merchandise for resale: massive cabinets (B) and medium cabinets (M). Every massive shelf prices $500 and requires 100 cubic ft of cupboard space, and every medium shelf prices $300 and requires 90 cubic ft of cupboard space. The corporate has $75000 to spend money on cabinets this week, and the warehouse has 18000 cubic ft obtainable for storage. Revenue for every massive shelf is $300 and for every medium shelf is $150. What's the most revenue? Reply $25000 $35000 $45000 $55000 $65000 Query 10 The next is a graph of a linear programming drawback. The possible answer area is shaded, and the optimum answer is on the level labeledZ*. graph didn't copy/paste The equation for constraint DH is: Reply 4X + 8Y ? 32 8X + 4Y ? 32 X + 2Y ? eight 2X + Y ? eight Query 11 The manufacturing supervisor for the Coory delicate drink firm is contemplating the manufacturing of two sorts of sentimental drinks: common and weight loss program. Two of her restricted assets are manufacturing time (eight hours = 480 minutes per day) and syrup (1 of her substances) restricted to 675 gallons per day. To provide a daily case requires 2 minutes and 5 gallons of syrup, whereas a weight loss program case wants four minutes and three gallons of syrup. Income for normal delicate drink are $three.00 per case and income for weight loss program delicate drink are $2.00 per case. For the manufacturing mixture of 135 instances of standard and zero instances of weight loss program delicate drink, which assets will not be utterly used? Reply solely time solely syrup time and syrup neither time nor syrup Query 12 In a linear programming drawback, the binding constraints for the optimum answer are: 5x1 + 3x2 ? 30 2x1 + 5x2 ? 20 Which of those goal capabilities will result in the identical optimum answer? Reply 2x1 + 1x2 7x1 + 8x2 80x1 + 60x2 25x1 + 15x2 Query 13 In a linear programming drawback, a sound goal perform could be represented as Reply Max Z = 5xy Max Z 5x2 + 2y2 Max 3x + 3y + 1/3z Min (x1 + x2) / x3 Query 14 Cully furnishings buys 2 merchandise for resale: massive cabinets (B) and medium cabinets (M). Every massive shelf prices $500 and requires 100 cubic ft of cupboard space, and every medium shelf prices $300 and requires 90 cubic ft of cupboard space. The corporate has $75000 to spend money on cabinets this week, and the warehouse has 18000 cubic ft obtainable for storage. Revenue for every massive shelf is $300 and for every medium shelf is $150. What's the goal perform? Reply MAX Z = $300B + $100 M MAX Z = $300M + $150 B MAX Z = $300B + $150 M MAX Z = $300B + $500 M Query 15 A graphical illustration of a linear program is proven under. The shaded space represents the possible area, and the dashed line within the center is the slope of the target perform. graph didn't copy/paste If it is a maximization, which excessive level is the optimum answer? Reply Level B Level C Level D Level E Query 16 The next is a graph of a linear programming drawback. The possible answer area is shaded, and the optimum answer is on the level labeledZ*. graph didn't copy/paste This linear programming drawback is a: Reply maximization drawback minimization drawback irregular drawback can not inform from the data given Query 17 The manufacturing supervisor for the Coory delicate drink firm is contemplating the manufacturing of two sorts of sentimental drinks: common (R) and weight loss program(D). Two of the restricted assets are manufacturing time (eight hours = 480 minutes per day) and syrup restricted to 675 gallons per day. To provide a daily case requires 2 minutes and 5 gallons of syrup, whereas a weight loss program case wants four minutes and three gallons of syrup. Income for normal delicate drink are $three.00 per case and income for weight loss program delicate drink are $2.00 per case. What's the time constraint? Reply 2R + 5D ? 480 2D + 4R ? 480 2R + 3D ? 480 2R + 4D ? 480 Query 18 Resolve the next graphically Max z = 3x1 +4x2 s.t. x1 + 2x2 ? 16 2x1 + 3x2 ? 18 x1 ? 2 x2 ? 10 x1, x2 ? zero Discover the optimum answer. What's the worth of the target perform on the optimum answer? Be aware: The reply can be an integer. Please give your reply as an integer with none decimal level. For instance, 25.zero (twenty 5) would be written 25 Reply Query 19 Max Z = $3x + $9y Topic to: 20x + 32y ? 1600 4x + 2y ? 240 y ? 40 x, y ? zero On the optimum answer, what's the quantity of slack related to the second constraint? Reply Query 20 Contemplate the next linear programming drawback: Max Z = $15x + $20y Topic to: 8x + 5y ? 40 zero.4x + y ? four x, y ? zero On the optimum answer, what's the quantity of slack related to the primary constraint? Reply