a) (1 point) Create the initial transportation table that will be used to minimize the retraining cost.

b) (1 point) By using North-West Corner rule find a feasible reassignment plan

c) (1 point) Decide whether the reassignment plan that you have found in part b is optimal or not.

d) (1 point) If your answer to part b is not optimal find a better reassignment plan by running transportation algorithm once.

e) (1 point) Find the optimal reassignment plan by transportation algorithm.

f) (1 point) Formulate a linear program to determine a reassignment plan that will minimize the retraining cost.

2. In a large city a number of city workers will have their jobs eliminated because their skills are no longer needed. The three categories to be eliminated include 20, 15, and 25 people, respectively. At the same time, the city finds itself needing an additional 15 electricians, 10 truck drivers, and 35 computer operators. The city decides to retain its employees from the categories being eliminated. The table below gives the retraining costs to move from the respective obsolete categories to the needed categories. Electrician 800 500 600 Category 1 Category 2 Category 3 To Truck Driver 600 400 700 Computer Operator 400 500 900 From