- Asked 12/34
- 2068 Baishakh · 5 marks
Graphical method max:Z=x₁+1.5x₂
Short answer
Plot the three constraints and find corner points: (0,0), (70,0), (60,20), (40,40), (0,60). Evaluating Z = x₁ + 1.5x₂ gives maximum 100 at x₁ = 40, x₂ = 40.
Maximize Z = x₁ + 1.5x₂ subject to the constraints 2x₁ + 2x₂ ≤ 160, x₁ + 2x₂ ≤ 120, 4x₁ + 2x₂ ≤ 280, x₁ ≥ 0 and x₂ ≥ 0 graphically.
Step 1: Draw the constraint lines. Replace each inequality by an equation, find the intercepts and decide which side of the line is allowed (test the origin).
| Constraint | Line | Meets x-axis | Meets y-axis | Allowed side |
|---|---|---|---|---|
| (1) 2x₁ + 2x₂ ≤ 160 | 2x₁ + 2x₂ = 160 | (80, 0) | (0, 80) | towards the origin |
| (2) x₁ + 2x₂ ≤ 120 | x₁ + 2x₂ = 120 | (120, 0) | (0, 60) | towards the origin |
| (3) 4x₁ + 2x₂ ≤ 280 | 4x₁ + 2x₂ = 280 | (70, 0) | (0, 140) | towards the origin |
Also x₁ ≥ 0 and x₂ ≥ 0, so the region lies in the first quadrant.
Step 2: Feasible region. The region satisfying all constraints is the shaded polygon below (dots), with corner points marked A, B, C, ….
68|
|
|E
|......
|..........
|...............
|....................
|......................D
|..........................
|............................
|..............................
|................................ C
|..................................
|...................................
|....................................
|.....................................
0|A.....................................B
+--------------------------------------------
0 79
Step 3: Corner points and the objective value. The optimum of a linear function over a convex polygon occurs at a corner point.
| Point | Coordinates | Lines meeting there | Z = x₁ + 1.5x₂ |
|---|---|---|---|
| A | (0, 0) | x₁ = 0, x₂ = 0 | 0 |
| B | (70, 0) | (3), x₂ = 0 | 70 |
| C | (60, 20) | (1), (3) | 90 |
| D | (40, 40) | (1), (2) | 100 |
| E | (0, 60) | (2), x₁ = 0 | 90 |
Step 4: Conclusion. The largest value of Z is 100, at D(40, 40).
Answer: Maximum Z = 100 at x₁ = 40, x₂ = 40.
✓ Answer checked by Claude Opus 5.5 (high effort)
Related questions
- Graphical method max:Z=7x₁+10x₂ · Mathematics III, chapter 5 · asked 12×
- Graphical method max:Z=5x₁+3x₂ · Mathematics III, chapter 5 · asked 12×
- Graphical method max:z=2x₁+3x₂ · Mathematics III, chapter 5 · asked 12×
- Graphical method max:Z=4x₁+5x₂ · Mathematics III, chapter 5 · asked 12×
- Graphical max/min min:z=9x+40y · Mathematics III, chapter 5 · asked 12×
- Graphical max/min min:Z=5x₁+3x₂ · Mathematics III, chapter 5 · asked 12×
- Graphical max/min opt:Z=4x₁+5x₂ · Mathematics III, chapter 5
- Big-M method max:Z=4x₁+5x₂ · Mathematics III, chapter 5 · asked 15×
- Big-M method max:P=2x₁+5x₂ · Mathematics III, chapter 5 · asked 15×
- Big-M method max:P=2x₁+5x₂ · Mathematics III, chapter 5 · asked 3×
- Graphical method min:z=4x₁+3x₂+x₃ · Mathematics III, chapter 5
- Simplex method max:Z=4x+3y · Mathematics III, chapter 5 · asked 17×
- Centre, axes of ellipse 2x²+3y²−4x−12y+13=0 · Mathematics I, chapter 3 · asked 7×
- Convergence of 2x+3x²/8+4x³/27+... · Mathematics, chapter 6 · asked 3×