please write well

34. Determine whether each statement is correct or not by marking either 0 or X. (Your score will be reduced by the points of the statement if you give a wrong answer. If you leave the answer blank, it will be zero point.) (e) (2 points) Every optimal solution of LP problems is on the vertex of the feasible regions. ( ) (f) (2 points) If the LP relaxation of an IP problem is infeasible, the IP problem is also infeasible. ( ) (g) (2 points) For an LP problem, if a constraint is binding the shadow price associated with the constraint is 0.C ) (h) (2 points) The Simplex algorithm cannot determine if the LP problem is unbounded or not. ) (i) (2 points) For an IP problem, the cut-off of nodes occurs when the incumbent solution is not worse than the LP relaxation bound of the nodes. ( ) 6) (2 points) In general, LP problems are easier to solve than IP problems. )