required to answer multiple choice!^

The point (1,3) satisfies all three constraints. satisfies the first and second constraints but not the third. satisfies the first and third constraints but not the second. satisfies the second and third constraints but not the first. none of the above. The point (15/7,8/7) is feasible but not optimal. infeasible. an optimal solution. not an intersection point. none of the above. The following linear programming problem can be solved with the graphic methods. The graph except for a line for the objective function has been drawn. You are required to finish the graph and then answer the following questions. Mins.t.4x1+10x24x1+1x282x1+5x2102x1+23x26x1,x20 The point (2,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. The following solutions are optimal (15/7,8/7) (5,0) (4,2/5) all of the above none of the above The point (3,54) satisfies none of the constraint. only one constraint. only two constraints. all three constraints. none of the above. The feasible region of this problem is unbounded. is a straight line segment. contains the origin. all of the above. none of the above. The optimal objective function value is 20 6 0 15/7 8/7 The point (221,1) is feasible. on the boundary of the feasible region. optimal. all of the above. none of the above. Assigning a value of 40 to the objective function, i.e., making 4x1+10x2=40, the line for the objective function goes through the following two points (10,0) and (4,0) (10,0) and (0,4) (0,10) and (0,4) (0,10) and (4,0) none of the above This problem does not have a feasible solution. has alternative optimal solutions. has an unbounded objective function. has a unique, i.e., a single, optimal solution. none of the above