Use the simplex method to solve the linear programming problem.Maximizez = 4x1 + 2x2subject to:2x1 + 3x2 ? 6 x1 + 3x2 ? 4 2x1 + 2x2 ? 8withx1 ? 0, x2 ? 0
A. Maximum is 8 when x1 = 0, x2 = 2
B. Maximum is 16 when x1 = 4, x2 = 0
C. Maximum is 12 when x1 = 3, x2 = 0
D. Maximum is 6 when x1 = 0, x2 = 3
Answer: C
You might also like to view...
Provide an appropriate response.Rank the numbers in order from smallest to largest.2.41 x 103, 5.12 x 106, 7.35 x 10-4, 6.84 x 103, 5.14 x 10-6
A. 5.14 x 10-6 < 7.35 x 10-4 < 2.41 x 103 < 6.84 x 103 < 5.12 x 106 B. 5.14 x 10-6 < 2.41 x 103 < 6.84 x 103 < 5.12 x 106 < 7.35 x 10-4 C. 5.12 x 106 < 6.84 x 103 < 2.41 x 103 < 7.35 x 10-4 < 5.14 x 10-6 D. 7.35 x 10-4 < 5.14 x 10-6 < 2.41 x 103 < 6.84 x 103 < 5.12 x 106
Solve the problem."If there is a choice that has a majority of the first-place votes in an election, then that choice should be the winner of the election." This fairness criterion is called the
A. independence of irrelevant alternatives criterion. B. Condorcet criterion. C. monotonicity criterion. D. majority criterion. E. none of these
Provide an appropriate response.Determine the area of the shaded region:
A. 34.93 m2 B. 31.91 m2 C. 32.91 m2 D. 34.19 m2
Round the number as indicated.9226 to the nearest ten
A. 9220 B. 9230 C. 9330 D. 9240