The following is a graph of a feasible region of a maximization linear programming problem: X₂ 3 2. 1 O X2 < 3 1 2 3 4 5 6 Which of the following equations represented on the graph is redundant and is not a border of the feasible region? O 4x1 + 6x2 ≤ 24 X1 + 4x2 ≥ 4 O X1-2x2 ≤ 2 X2 ≤ 2 X₁

Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter5: Network Models
Section5.5: Shortest Path Models
Problem 30P
icon
Related questions
Question
Question 9
The following is a graph of a feasible region of a maximization linear programming problem:
X₂
3
2.
12
-1
O X2 ≤ 3
1 2 3 4 5 6
Which of the following equations represented on the graph is redundant and is not a border of the feasible region?
4x1 + 6x2 s 24
O X1 + 4x2 ≥ 4
O X1 - 2x2 ≤ 2
O X2 ≤ 2
X₁
Transcribed Image Text:Question 9 The following is a graph of a feasible region of a maximization linear programming problem: X₂ 3 2. 12 -1 O X2 ≤ 3 1 2 3 4 5 6 Which of the following equations represented on the graph is redundant and is not a border of the feasible region? 4x1 + 6x2 s 24 O X1 + 4x2 ≥ 4 O X1 - 2x2 ≤ 2 O X2 ≤ 2 X₁
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Practical Management Science
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,