Given below is the Sensitivity Report for a linear programing problem. While the problem is structured as a binary linear program, it was run as a standard linear program meaning that all the reported dual variables are all legitimate to evaluate and use. The people are given by A, B, C, and D, and the jobs they can be assigned to are l, 2, 3, and 4. The goal of the rm is to assign each individual to the proper job to maximize the rm's total revenue. The objective coefcient represents the per unit revenue a person earns from doing each job. Variable Cells Final Reduced Objective Allowable Allowable Cell Name Value Cost Coefficient Increase Decrease $B$5 Solution Values xAl 0 0 10 6 2 505.5 Solution Values xA2 0 -5 8 5 1E+30 5055 Solution Values xA3 1 0 15 1E+30 1 $E$5 Solution Values xA4 O 0 12 1 5 $F$5 Solution Values x31 0 -3 11 3 1E+30 $655 Solution Values x32 0 0 17 2 5 $H$5 Solution Values x33 0 -1 18 1 1E+30 $I$5 Solution Values x34 1 0 16 5 1 $J$5 Solution Values xCl o -2 4 2 1E+30 $K$5 Solution Values xCZ 1 0 9 1E+30 2 $L$5 Solution Values xCB 0 -3 8 3 1E+30 $M$5 Solution Values xC4 O -6 2 6 1E+30 $N$5 Solution Values x01 1 0 22 1E+30 6 $055 Solution Values x02 0 -6 19 6 1E+30 $P$5 Solution Values xD3 o -11 16 11 1E+30 $Q$5 Solution Values xD4 o -7 17 7 1E+30