Question: QUESTION 34 ABC Company has developed the following linear programming problem: Max x 1 + x 2 s.t. 2x 1 + x 2 10 2x
QUESTION 34
ABC Company has developed the following linear programming problem:
| Max | x1 + x2 |
| s.t. | 2x1 + x2 10 |
| 2x1 + 3x2 24 | |
| 3x1 + 4x2 36 |
They find this problem is infeasible. In revision, the company drops the original objective and establishes 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. |
Select the appropriate constraint for Goal 1:
| a. | 2x1 + x2 + d1 d1+ = 10 | |
| b. | 2x1 + x2 + d1 d1+ = 10 | |
| c. | 3x1 + 4x2 + d1 d1+ = 10 | |
| d. | 2x1 + 3x2 + d1 d1+ = 10 |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
