a) State whether the following are true or false. i) In an LP problem, at least one corner point must be an optimal solution if an optimal solution exists. (2) ii) In an assignment problem, it may be necessary to add more than one row to the data. (2) iii) In the shortest route technique, the objective is to determine the route from an origin to a destination that passes through the fewest number of other nodes. (2) iv) An unrestricted primal variable will result in an equality dual constraint. (2) v) In transportation problem, a dummy source is given a zero cost, while in an assignment problem; a dummy source is given a very high cost. (2)