This linear programming model has a unique, i.e., only one, optimal solution alternative optimal solutions an unbounded objective function no feasible solution none of the above QUESTION 11 The point (1,4) satisfies none of the constraints. he first and second constraints but not the third. the first and third constraints but not the second. the second and third constraints but not the first. all three constraints. QUESTION 12 Assigning a value of 20 to the objective function, i.e., making 4X1+20X2=20 the line for the objective function goes through the following two points (1,0) and (5,0) (0,1) and (0,5) (1,0) and (0,5) (5,0) and (0,1) none of the above QUESTION 13 The feasible region of this problem is unbounded. is a straight line segment. contains the origin. all of the above. none of the above. QUESTION 15 The point (90/19,20/19) is feasible but not optimal. infeasible. optimal. not an intercept point. none of the above. QUESTION 16 The point (6,3) is feasible. not on the boundary of the feasible region. not optimal. all of the above. none of the above. QUESTION 17 The point (3,1) satisfies the first constraint but not the other two. the second constraint but not the other two. the third constraint but not the other two. all three constraints. none of the above. QUESTION 18 The point (10,0) is feasible but not optimal. an optimal solution. infeasible. not on the boundary of the feasible region. none of the above. QUESTION 19 The value of the objective function at the point (90/19,20/19) is This linear programming model has a unique, i.e., only one, optimal solution alternative optimal solutions an unbounded objective function no feasible solution none of the above QUESTION 11 The point (1,4) satisfies none of the constraints. he first and second constraints but not the third. the first and third constraints but not the second. the second and third constraints but not the first. all three constraints. QUESTION 12 Assigning a value of 20 to the objective function, i.e., making 4X1+20X2=20 the line for the objective function goes through the following two points (1,0) and (5,0) (0,1) and (0,5) (1,0) and (0,5) (5,0) and (0,1) none of the above QUESTION 13 The feasible region of this problem is unbounded. is a straight line segment. contains the origin. all of the above. none of the above. QUESTION 15 The point (90/19,20/19) is feasible but not optimal. infeasible. optimal. not an intercept point. none of the above. QUESTION 16 The point (6,3) is feasible. not on the boundary of the feasible region. not optimal. all of the above. none of the above. QUESTION 17 The point (3,1) satisfies the first constraint but not the other two. the second constraint but not the other two. the third constraint but not the other two. all three constraints. none of the above. QUESTION 18 The point (10,0) is feasible but not optimal. an optimal solution. infeasible. not on the boundary of the feasible region. none of the above. QUESTION 19 The value of the objective function at the point (90/19,20/19) is