1.4 (6 points) The following linear programming problem has no feasible solution. min 0x1 + 0x2 s.t. X1 + x2 40 (3) X1, X2 > 0 Assume that we have the penalty cost $10 for failing to satisfy 1 unit of 10 in the 1st constraint; the penalty cost $5 for failing to satisfy 1 unit of 15 in the 2nd constraint; the penalty cost $1 for failing to satisfy 1 unit of 40 in the 3rd constraint. Please add some deviational variables on these three constraints to formulate this problem as a goal programming problem to minimize the penalty cost (just write a linear programming model with explanations on new variables). 1.4 (6 points) The following linear programming problem has no feasible solution. min 0x1 + 0x2 s.t. X1 + x2 40 (3) X1, X2 > 0 Assume that we have the penalty cost $10 for failing to satisfy 1 unit of 10 in the 1st constraint; the penalty cost $5 for failing to satisfy 1 unit of 15 in the 2nd constraint; the penalty cost $1 for failing to satisfy 1 unit of 40 in the 3rd constraint. Please add some deviational variables on these three constraints to formulate this problem as a goal programming problem to minimize the penalty cost (just write a linear programming model with explanations on new variables)