Multiple Choice only

Question 14 3 Points In a simplex iteration, the pivot element can be zero or negative True B) False Question 15 5 Points Consider the following linear programming problem. Maximize 12X+ 10X Subject to: 4%,+ 3 X2 480 2X2 + 3X2 5360 all variables 20 Which of the following points (XX) could be a feasible corner point? A (40,48) B (30,36) (120,0) D (180.120) Question 12 3 Points Which of the following is not true of the simplex procedure A Each iteration results in a new solution which is as good as or better than the previous solution The procedure ensures that the optimal solution is reached in the minimum number of iterations The procedure indicates when the optimal solution has been reached None of the above Question 13 3 Points In labor planning formulation, how would you write the constraint that there are only to full-time tellers (labeled as X.) available? A) X B) X CX-10 xs