A dishonest politician has four candidates for four patronage jobs. Each candidate has agreed to bribe the politician to obtain each job, by amounts shown in the matrix below (units of thousands of dollars). Find two different ways of assigning the candidates to jobs, each of which maximizes the politician's total profit. Do this problem by hand, and not in Mathematica.

Transcribed Image Text:

candidate job 2 2 10 3 3 2 2 101 4 2 2 3 1 Exercise 12 states 3 2 3 1 1 4 1 2 3 2 branches 1 2 5 1 1 1 4 4 3 0 3 214 2 Exercise 13