Use the simplex method to solve the linear programming Maximize z = 10x1 + 15x2 problem. subject to: 12x1 + 3x2 5 42 5x1 + x2 5 20 3x.I + 3x2 5 48 with x1 2 0, x2 2 0 E> Select the correct choice below and, if necessary, ll in the answer boxes to complete your choice. '33 A- The maximum is when x1 = ,x2 = ,s1 = , s2 = , and s3 = (Type integers or simplified fractions.) {E} B. There is no maximum. Set up the following for solution by the simplex method. First express the linear constraints and objective function, then add slack variables to convert each constraint into a linear equation, and then set up the initial simplex tableau. A manufacturer of bicycles builds racing, touring, and mountain models. The bicycles are made of both aluminum and steel. The company has available 92,400 units of steel and 44,000 units of aluminum. The racing, touring, and mountain models need 18, 26, and 34 units of steel, and 19, 29, and 11 units of aluminum, respectively. How many of each type of bicycle should be made in order to maximize prot if the company makes $6 per racing bike, $13 per touring bike, and $25 per mountain bike? What is the maximum possible prot? Let x1, x2, and x3 be the numbers of racing, touring, and mountain bicycles, respectively. Express the linear constraints and objective function. Maximize z = 1 subject to: 1