Solve the linear programming problem using the simplex method.

Homework: Section 6.2 Homework Save Score: 0 of 1 pt 1 of 5 (0 complete) HW Score: 0%, 0 of 5 pts 6.2.13 Question Help Solve the linear programming problem using the simplex method. Maximize P =30X, + 40x2 subject to 2x1 + X2 = 40 *1 + X2 = 28 X1 + 2X2 = 48 * 1 , X 2 20 Use the simplex method to solve the problem. Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice. O A. The maximum value of P is when x1 = and x2 =. O B. There is no optimal solution. Click to select and enter your answer(s) and then click Check Answer. ? All parts showing Clear All Check Answer Type here to search O 5:06 AM 5/5/2020Homework: Section 6.2 Homework Save Score: 0 of 1 pt 2 of 5 (0 complete) HW Score: 0%, 0 of 5 pts 6.2.15 Question Help Solve the linear programming problem using Maximize P=2X1 +3X2 the simplex method. subject to - 2x1 + X2 5 12 - X1 + X2 =30 X2 $36 X 1 , X2 20 Use the simplex method to solve the problem. Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice. O A. The maximum value of P is when x1 = and x2 =. O B. There is no optimal solution. Click to select and enter your answer(s) and then click Check Answer. ? All parts showing Clear All Check Answer Type here to search 5:06 AM 5/5/2020Homework: Section 6.2 Homework Save Score: 0 of 1 pt 3 of 5 (0 complete) HW Score: 0%, 0 of 5 pts 6.2.17 Question Help Solve the linear programming Maximize P = -X1 + 2X2 problem using the simplex method. subject to - X1 + X2 $2 - Xy + 3X2 = 12 Xy - 4X2 = 10 X 1 , X2 20 Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice. O A. The maximum value of Pis P = when x1 = and x2 =. (Simplify your answers.) O B. There is no optimal solution. Click to select and enter your answer(s) and then click Check Answer. ? All parts showing Clear All Check Answer Type here to search O 5:06 AM 5/5/2020Homework: Section 6.2 Homework Save Score: 0 of 1 pt 4 of 5 (0 complete) HW Score: 0%, 0 of 5 pts 6.2.21 Question Help Solve the linear programming problem using the simplex method. Maximize P=2x1 +3x2+ 4x3 subject to X1 + X3 = 36 X2 + Xg $27 X 1 1 X2, X3 20 Use the simplex method to solve the problem. Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice. A. The maximum value of P is , when x1 = , x2 = , and x3 = O B. There is no optimal solution. Click to select and enter your answer(s) and then click Check Answer. ? All parts showing Clear All Check Answer Type here to search 5:06 AM 5/5/2020 FAHomework: Section 6.2 Homework Save Score: 0 of 1 pt 5 of 5 (0 complete) HW Score: 0%, 0 of 5 pts Bus Econ 6.2.37 i Question Help A small company manufactures three different electronic components for computers. Component A requires 2 hours of fabrication and 1 hour of assembly; component B requires 3 hours of fabrication and 1 hour of assembly; and component C requires 2 hours of fabrication and 2 hours of assembly. The company has up to 900 labor-hours of fabrication time and 650 labor-hours of assembly time available per week. The profit on each component, A, B, and C, is $7, $8, and $10, respectively. How many components of each type should the company manufacture each week in order to maximize its profit (assuming that all components manufactured can be sold)? What is the maximum profit? Let X1, X2, and X3 be the numbers of components A, B, and C, respectively, that get manufactured. Construct a mathematical model in the form of a linear programming problem. Maximize P = subject to Fabrication time restriction Assembly time restriction X1 , X2, X3 20 Enter your answer in the edit fields and then click Check Answer. ? part remaining Clear All Check Answer Type here to search O 5:06 AM 5/5/2020