Gand p manufacturing would like to minimize the labor cost of producing dishwasher motors for a major appliance manufacturer. two models of motors exist and the time in hours required for each model in each production area is tabled here, along with the labor cost

model 1model 2
area a (hrs)1216
area b (hrs)108
area c (hrs)1412
cost ($)100120

currently, labor assignments provide for 38,000 hours in area a, 25,000 hours in area b and 27,000 hours in area c. 2,000 hours are available to be transferred from area b to area c and a combined total of 4,000 hours are available to be transferred from area a to areas b and c. we would like to develop the linear programming model whose solution would tell g& p how many of each model to produce and how to allocate the workforce.

let
p1= the number of model 1 motors to produce
p2= the number of model 2 motors to produce
tac= the number of hours transferred from a to c
tab= the number of hours transferred from a to b
tbc= the number of hours transferred from b to c

what is the objective function?
a. max 14p1+12p2
b. min 10p1+8p2
c. min 100p1+ 120p2
d. max 100p1+120p2
e. min 12 p1+ 16p2