Details of this Paper

Strayer MAT540 week 7 quiz 3

Description

solution


Question

Question;Question 1;1.;If the objective function is parallel to a constraint, the constraint is;infeasible.;Answer;True;False;2;points;Question 2;1.;In minimization LP problems the feasible region is always below the;resource constraints.;Answer;True;False;2;points;Question 3;1.;A linear programming model consists of only decision variables and;constraints.;Answer;True;False;2;points;Question 4;1.;If the objective function is parallel to a constraint, the constraint is;infeasible.;Answer;True;False;2;points;Question 5;1.;Surplus variables are only associated with minimization problems.;Answer;True;False;2;points;Question 6;1.;The following inequality represents a resource constraint for a;maximization problem;X + Y? 20;Answer;True;False;2;points;Question 7;1.;Graphical solutions to linear programming problems have an infinite;number of possible objective function lines.;Answer;True;False;2;points;Question 8;1.;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?;Answer;MAX $2R + $4D;MAX $3R + $2D;MAX $3D + $2R;MAX $4D + $2R;2;points;Question 9;1.;In a linear programming problem, a valid objective function can be;represented as;Answer;Max Z = 5xy;Max Z 5x2 + 2y2;Max 3x + 3y + 1/3z;Min (x1 + x2) / x3;2;points;Question;10;1.;Which of the following statements is not true?;Answer;An infeasible solution violates all constraints.;A feasible solution point does not have to lie on;the boundary of the feasible solution.;A feasible solution satisfies all constraints.;An optimal solution satisfies all constraints.;2;points;Question;11;1.;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?;Answer;$25000;$35000;$45000;$55000;$65000;2;points;Question;12;1.;Which of the following could be a linear programming objective;function?;Answer;Z = 1A + 2BC + 3D;Z = 1A + 2B + 3C + 4D;Z = 1A + 2B / C + 3D;all of the above;2;points;Question;13;1.;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;Answer;maximization problem;minimization problem;irregular problem;cannot tell from the information given;2;points;Question;14;1.;In a linear programming problem, the binding constraints for the optimal;solution are;5x1 +;3x2? 30;2x1 +;5x2? 20;Which of these objective functions will lead to the same optimal solution?;Answer;2x1 + 1x2;7x1 + 8x2;80x1 + 60x2;25x1 + 15x2;2;points;Question;15;1.;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?;Answer;A;J;H;G;2;points;Question;16;1.;The linear programming problem;MIN Z = 2x1 + 3x2;Subject to: x1 + 2x2? 20;5x1 + x2? 40;4x1 +6x2? 60;x1, x2? 0;Answer;has only one solution.;has two solutions.;has an infinite number of solutions.;does not have any solution.;2;points;Question;17;1.;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?;Answer;MAX Z = $300B + $100 M;MAX Z = $300M + $150 B;MAX Z = $300B + $150 M;MAX Z = $300B + $500 M;2;points;Question;18;1.;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?;Answer;2;points;Question;19;1.;Consider the following minimization;problem;Min z = x1 + 2x2;s.t. x1+ x2?;300;2x1 + x2? 400;2x1 + 5x2? 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;Answer;2;points;Question;20;1.;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.;Answer

 

Paper#60449 | Written in 18-Jul-2015

Price : $21
SiteLock