Consider the following pre-emptive goal programming model.
Minimize P_(1)(d_(1)^(+)+d_(2)^(-))+P_(2)(d_(3)^(-))+P_(3)(d_(4)^(-)+2d_(5)^(-))
subject to
2x_(1)+3x_(2)-d_(1)^(+)+d_(1)^(-),=680
2x_(1)+3x_(2),-d_(2)^(+)+d_(2)^(-),=600
250x_(1)+125x_(2),-d_(3)^(+)+d_(3)^(-),=70,000
x_(1),-d_(4)^(+)+d_(4)^(-),=200
x_(2),-d_(5)^(+)+d_(5)^(-)=120
x_(1),x_(2),d_(1)^(-),d_(1)^(+),d_(2)^(-),d_(2)^(+),d_(3)^(-),d_(3)^(+),d_(4)^(-),d_(4)^(+),d_(5)^(-),d_(5)^(+)>=0
(a) Use the graphical goal programming procedure to solve the problem. (b) If the first and third priority levels are interchanged, what would be the new solution? (5 marks) Please give me the complete solution with brief explanation about all the variables used. Make sure the solution is correct.