(4 points) Touche Young has three auditors. Each can work as many as 160 hours during the next month, during which time three projects must be completed.

Project 1 will take 130 hours; project 2, 140 hours; and project 3, 160 hours.

Because of varying specialties, the auditors are billed at different hourly rates per project Auditor 1 can be billed at 120 / 150 / 190 for each hour of project 1 / 2 / 3 Auditor 2 can be billed at 140 / 130 / 120 for each hour of project 1 / 2 / 3 Auditor 3 can be billed at 160 / 140 / 150 for each hour of project 1 / 2 / 3 Unused Auditor time will be assigned to a fourth in-house project at hourly rates of $0 (i.e. a dummy project that will make it a balanced transportation problem)

Formulate a balanced transportation problem (each Auditor is a supplier) to maximize total billings during the next month. (maximize just means we pivot on largest negative row0 values)

Here is the initial tableau by the NorthWest method tableau

Here is the initial tableau by the North West method tableau 1 1200 1500 | 190 500 .10 130 2140401300 1200030 0 N 110 B 50 B DN 3 1 60 30 140 20 150 0 0 0 0 NON110B50 B Demand 130 140 160 50 Find the optimal tableau. Each 2x2 matrix is the relevant square in the tableau. (For grading convenience, in bottom right corner of each box use 1 for "B" and 0 for "N") Here is the initial tableau by the North West method tableau 1 1200 1500 | 190 500 .10 130 2140401300 1200030 0 N 110 B 50 B DN 3 1 60 30 140 20 150 0 0 0 0 NON110B50 B Demand 130 140 160 50 Find the optimal tableau. Each 2x2 matrix is the relevant square in the tableau. (For grading convenience, in bottom right corner of each box use 1 for "B" and 0 for "N")