5.3 Three men are to be scheduled to perform six different tasks. The ith man can perform a units of the jth task in one hour and is paid c dollars for one hour's work on the jth task. The total number of hours which the ith man can work is b;, and the number of units required to complete the jth task is b2j. A minimum of the cost P is desired: P = -WE WE 6 1=1 j=1 C1X11 where xi; is the number of hours that the ith man spends on the jth task. Place this problem in a standard linear programming form. 600 +