Details of this Paper

Strayer Mat540 week 7 quiz 3 Summer 2014

Description

solution


Question

Question;Question 1A linear programming model consists of only decision variables and constraints.AnswerTrueFalse2 points Question 2A feasible solution violates at least one of the constraints.AnswerTrueFalse2 points Question 3The following inequality represents a resource constraint for a maximization problem: X + Y? 20AnswerTrueFalse2 points Question 4If the objective function is parallel to a constraint, the constraint is infeasible.AnswerTrueFalse2 points Question 5If the objective function is parallel to a constraint, the constraint is infeasible.AnswerTrueFalse2 points Question 6Graphical solutions to linear programming problems have an infinite number of possible objective function lines.AnswerTrueFalse2 points Question 7In a linear programming problem, all model parameters are assumed to be known with certainty.AnswerTrueFalse2 points Question 8In a linear programming problem, a valid objective function can be represented asAnswerMax Z = 5xyMax Z 5x2 + 2y2Max 3x + 3y + 1/3zMin (x1 + x2) / x32 points Question 9The following is a graph of a linear programming problem. The feasible solution space is shaded, and the optimal solution is at the point labeledZ*.Which of the following constraints has a surplus greater than 0?AnswerBFCGDHAJ2 points Question 10In a linear programming problem, the binding constraints for the optimal solution are: 5x1 + 3x2? 30 2x1 + 5x2? 20Which of these objective functions will lead to the same optimal solution?Answer2x1 + 1x27x1 + 8x280x1 + 60x225x1 + 15x22 points Question 11) Which of the following could be a linear programming objective function?AnswerZ = 1A + 2BC + 3DZ = 1A + 2B + 3C + 4DZ = 1A + 2B / C + 3Dall of the above2 points Question 12Which of the following statements is not true?AnswerAn 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 13The 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?AnswerMAX $2R + $4DMAX $3R + $2DMAX $3D + $2RMAX $4D + $2R2 points Question 14The linear programming problem:MIN Z = 2x1 + 3x2Subject to: x1 + 2x2? 20 5x1 + x2? 40 4x1 +6x2? 60 x1, x2? 0,Answerhas only one solution.has two solutions.has an infinite number of solutions.does not have any solution.2 points Question 15Cully 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?AnswerMAX Z = $300B + $100 MMAX Z = $300M + $150 BMAX Z = $300B + $150 MMAX Z = $300B + $500 M2 points Question 16The following is a graph of a linear programming problem. The feasible solution space is shaded, and the optimal solution is at the point labeledZ*.The equation for constraint DH is:Answer4X + 8Y? 328X + 4Y? 32X + 2Y? 82X + Y? 82 points Question 17Cully 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$650002 points Question 18Solve the following graphicallyMax z = 3x1 +4x2s.t. x1 + 2x2? 16 2x1+ 3x2? 18 x1? 2 x2? 10 x1, x2? 0Find 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 19A 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.Answer2 points Question 20Consider the following minimization problem:Min z = x1 + 2x2s.t. x1+ x2? 300 2x1+ x2? 400 2x1+ 5x2? 750 x1, x2? 0Find 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 Save and Submit

 

Paper#60723 | Written in 18-Jul-2015

Price : $29
SiteLock