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
Q25: When using a linear programming approach to
Q34: A required step in the analytic hierarchy
Q35: Pair-wise comparisons are used to
A) compare criteria
Q36: Inconsistency in the pair-wise judgments is indicated
Q38: The goal programming problem below was solved
Q40: Rosie's Ribs is in need of an
Q41: How can you be sure your rankings
Q42: Explain the difference between hard and soft
Q43: Explain why goal programming could be a
Q44: In an AHP problem, the priorities for
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents