Question
QUESTION 35 ABC Company has developed the following linear programming problem: Max x 1 + x 2 s.t. 2x 1 + x 2 10 2x
QUESTION 35
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 2:
| a. | 2x1 + 3x2 + d2 d2+ = 24 | |
| b. | 2x1 + 3x2 + d2 d2+ 24 | |
| c. | 2x1 + 3x2 + d2 d2+ 24 | |
| d. | 2x1 + 3x2 + d2 d2+ 24 |
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Money Banking And Financial Markets
Authors: Lloyd B. Thomas
1st International Edition
0070644365, 9780070644366
