Question: The following linear programming problem has no feasible solution. min 0x1 + 0x2 s.t. 3X1 + 2x2 > 30 (1) 2x1 + x2 > 40

The following linear programming problem has no

The following linear programming problem has no feasible solution. min 0x1 + 0x2 s.t. 3X1 + 2x2 > 30 (1) 2x1 + x2 > 40 (2) 5x1 + 3x2 0 Assume that we have the penalty cost $150 for failing to satisfy 1 unit of 30 in the 1st constraint; the penalty cost $10 for failing to satisfy 1 unit of 40 in the 2nd constraint; also $50 penalty is assessed for each unit exceeding 50 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)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!