QUESTION 5 The type of network problems in which the capacity of each branch is not taken into account is known as: Maximal Flow Problems Shortest-route Problems Minimal-Spanning Tree Problems Shortest-route Problems and Minimal-Spanning Tree Problems QUESTION 6 One of the following statement is FALSE regarding non-linear programming problems Solution methods generally involve searching a solution surface for high or low points Solution methods are more complex than linear programming The optimal solution is not necessarily on the boundary of the feasible area Solutions methods will always reach the global optimal solution QUESTION 7 One of the following statements is FALSE regarding Assignment problems: Supply at each source and demand at each source are equal to 1 It is a special form of non-linear programming models In an unbalanced model, supply does not equal demand In a balanced model, supply equals demand QUESTION 5 The type of network problems in which the capacity of each branch is not taken into account is known as: Maximal Flow Problems Shortest-route Problems Minimal-Spanning Tree Problems Shortest-route Problems and Minimal-Spanning Tree Problems QUESTION 6 One of the following statement is FALSE regarding non-linear programming problems Solution methods generally involve searching a solution surface for high or low points Solution methods are more complex than linear programming The optimal solution is not necessarily on the boundary of the feasible area Solutions methods will always reach the global optimal solution QUESTION 7 One of the following statements is FALSE regarding Assignment problems: Supply at each source and demand at each source are equal to 1 It is a special form of non-linear programming models In an unbalanced model, supply does not equal demand In a balanced model, supply equals demand