1. In the transportation problem, if the number of allocation is less than m+n-1 then it is called as non-degenerate basic feasible solution. 2. In the transportation problem, the lowest cost entry method depend on determining the smallest cost in the cost matrix of the transportation table and allocate xij=min (ai,bj) in the cell (ij). 3. For an assignment problem with 3 agents and 4 tasks, the assignment matrix will have 3 rows and 4 columns. 4. In sequencing rules, job processing times is the only important piece of information. 5. In sequencing rules, the average number of jobs in the system is equal to total flow time divided by total job work time. 6. In the replacement model, an item should be replaced when the average cost to date becomes lower than the current maintenance cost. 7. In break-even analysis, the variable cost per unit increased with quantity produced. 8. A path through a project network must reach every node. Answer by (TRUE) or (FALSE) and correct the false one. 1. In the transportation problem, if the number of allocation is less than m+n-1 then it is called as non-degenerate basic feasible solution. 2. In the transportation problem, the lowest cost entry method depend on determining the smallest cost in the cost matrix of the transportation table and allocate xij=min (ai,bj) in the cell (ij). 3. For an assignment problem with 3 agents and 4 tasks, the assignment matrix will have 3 rows and 4 columns. 4. In sequencing rules, job processing times is the only important piece of information. 5. In sequencing rules, the average number of jobs in the system is equal to total flow time divided by total job work time. 6. In the replacement model, an item should be replaced when the average cost to date becomes lower than the current maintenance cost. 7. In break-even analysis, the variable cost per unit increased with quantity produced. 8. A path through a project network must reach every node. Answer by (TRUE) or (FALSE) and correct the false one. 1. In the transportation problem, if the number of allocation is less than m+n-1 then it is called as non-degenerate basic feasible solution. 2. In the transportation problem, the lowest cost entry method depend on determining the smallest cost in the cost matrix of the transportation table and allocate xij=min (ai,bj) in the cell (ij). 3. For an assignment problem with 3 agents and 4 tasks, the assignment matrix will have 3 rows and 4 columns. 4. In sequencing rules, job processing times is the only important piece of information. 5. In sequencing rules, the average number of jobs in the system is equal to total flow time divided by total job work time. 6. In the replacement model, an item should be replaced when the average cost to date becomes lower than the current maintenance cost. 7. In break-even analysis, the variable cost per unit increased with quantity produced. 8. A path through a project network must reach every node. Answer by (TRUE) or (FALSE) and correct the false one.