Essay
The Lofton Company has developed the following linear programming problem
Max
x1 + x2
s.t.
2x1 + x2 ≤ 10
2x1 + 3x2 ≤ 24
3x1 + 4x2 ≥ 36
but finds it is infeasible. In revision, Lofton drops the original objective and establishes the three goals
Goal 1:
Don't exceed 10 in constraint 1.
Goal 2:
Don't fall short of 36 in constraint 3.
Goal 3:
Don't exceed 24 in constraint 2.
Give the goal programming model and solve it graphically.
Correct Answer:
Verified
Min
P1 d1+ , P2 d3− , P3 d2+
s.t.
2x1 + x2 + d1− ...View Answer
Unlock this answer now
Get Access to more Verified Answers free of charge
Correct Answer:
Verified
Min
P1 d1+ , P2 d3− , P3 d2+
s.t.
2x1 + x2 + d1− ...
View Answer
Unlock this answer now
Get Access to more Verified Answers free of charge
Q5: A problem involving only one priority level
Q6: Objectives in multicriteria problems seldom conflict.
Q8: The priority matrix shows the priority for
Q10: Like many high school seniors, Anne has
Q15: Why are multicriteria problems of special interest
Q16: The steps of the scoring model include
Q16: Calculating the priority of each criterion in
Q19: The goal programming problem with the objective
Q26: The constraint 5x<sub>1</sub> + 3x<sub>2</sub> ≤ 150
Q38: The goal programming approach can be used