- Asked 12/34
- 2069 Chaitra · 5 marks
Graphical method max:Z=4x₁+5x₂
Short answer
The feasible region is a quadrilateral with vertices (0,0), (7.5,0), (5,3), (0,5). The objective Z = 4x₁ + 5x₂ attains its maximum 35 at x₁ = 5, x₂ = 3.
Maximize Z = 4x₁ + 5x₂ subject to constraints 2x₁ + 5x₂ ≤ 25, 6x₁ + 5x₂ ≤ 45, 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₁ + 5x₂ ≤ 25 | 2x₁ + 5x₂ = 25 | (25/2, 0) | (0, 5) | towards the origin |
| (2) 6x₁ + 5x₂ ≤ 45 | 6x₁ + 5x₂ = 45 | (15/2, 0) | (0, 9) | 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, ….
6|
|
|
|D.
|......
|...........
|...............
|....................
|........................C
|..........................
|...........................
|.............................
|..............................
|................................
|.................................
|...................................
0|A...................................B
+--------------------------------------------
0 9
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 = 4x₁ + 5x₂ |
|---|---|---|---|
| A | (0, 0) | x₁ = 0, x₂ = 0 | 0 |
| B | (15/2, 0) | (2), x₂ = 0 | 30 |
| C | (5, 3) | (1), (2) | 35 |
| D | (0, 5) | (1), x₁ = 0 | 25 |
Step 4: Conclusion. The largest value of Z is 35, at C(5, 3).
Answer: Maximum Z = 35 at x₁ = 5, x₂ = 3.
✓ 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=x₁+1.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×
- Express x³−5x²+6x+1 in Legendre polynomials · Mathematics, chapter 4 · asked 3×
- 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×