---
title: "Graphical method max:Z=5x₁+3x₂"
subject: "Mathematics III"
chapter: 5
key: "semester_3/mathematics_iii:graphical-method-max-z-5x-3x"
source: https://www.bctengineer.com/q/semester_3/mathematics_iii/graphical-method-max-z-5x-3x
site: BCT Engineering
---

# Graphical method max:Z=5x₁+3x₂

Mathematics III · Chapter 5: Linear Programming

- Asked in: 2074 Chaitra, 5 marks; 2073 Shrawan, 5 marks; 2071 Shrawan, 5 marks (asked 3 times)
- Video: [[#1] LPP - Graphical method [ Maximization with 2 constraints ] solved problem :-by kauserwise](https://www.youtube.com/watch?v=8IRrgDoV8Eo) — Kauser Wise
- Answer checked by Claude Opus 5.5 (high effort) on 2026-10-14
- Page: https://www.bctengineer.com/q/semester_3/mathematics_iii/graphical-method-max-z-5x-3x
- Whole chapter: https://www.bctengineer.com/md/semester_3/mathematics_iii/chapter-5

## Question

Graphically maximize Z = 5x₁ + 3x₂ subject to the constraints x₁ + 2x₂ ≤ 50, 2x₁ + x₂ ≤ 40, x₁, x₂ ≥ 0.

## Short answer

Plot constraints x1+2x2≤50, 2x1+x2≤40, x1,x2≥0. Corner points: (0,0), (20,0), (10,20), (0,25). Max Z=5x1+3x2 is 110 at (10,20).

## Answer

**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) x₁ + 2x₂ ≤ 50 | x₁ + 2x₂ = 50 | (50, 0) | (0, 25) | towards the origin |
| (2) 2x₁ + x₂ ≤ 40 | 2x₁ + x₂ = 40 | (20, 0) | (0, 40) | 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, ….

```text
  29|                                            
    |                                            
    |D                                           
    |......                                      
    |.............                               
    |...................C                        
    |.....................                       
    |.......................                     
    |........................                    
    |..........................                  
    |............................                
    |.............................               
    |...............................             
    |.................................           
    |...................................         
    |....................................        
   0|A....................................B      
    +--------------------------------------------
     0                                         23
```

**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 = 5x₁ + 3x₂ |
|---|---|---|---|
| A | (0, 0) | x₁ = 0, x₂ = 0 | 0 |
| B | (20, 0) | (2), x₂ = 0 | 100 |
| C | (10, 20) | (1), (2) | 110 |
| D | (0, 25) | (1), x₁ = 0 | 75 |

**Step 4: Conclusion.** The largest value of Z is 110, at C(10, 20).

**Answer:** Maximum Z = 110 at x₁ = 10, x₂ = 20.

## Check yourself

The answer's key points as multiple-choice questions, with the correct option and why.

1. What are the intercepts of 2x1 + x2 = 40?
   A. (50, 0) and (0, 25)
   B. (20, 0) and (0, 20)
   C. (20, 0) and (0, 40)
   D. (40, 0) and (0, 20)
   Answer: C. Set each variable to zero in turn. (Key point: Intercepts)

2. Where do the two constraint lines meet?
   A. (0, 25)
   B. (20, 0)
   C. (20, 10)
   D. (10, 20)
   Answer: D. Solve x1 + 2x2 = 50 and 2x1 + x2 = 40: x1 = 10, x2 = 20. (Key point: Intersection)

3. Which corner gives the maximum Z = 5x1 + 3x2?
   A. B(20, 0) with Z = 100
   B. D(0, 25) with Z = 75
   C. C(10, 20) with Z = 110
   D. A(0, 0)
   Answer: C. 5(10) + 3(20) = 110 is the largest. (Key point: Comparing corners)

## Close variants set in other exams

- [Graphical method max:Z=7x₁+10x₂](https://www.bctengineer.com/question.md?key=semester_3%2Fmathematics_iii%3Agraphical-method-max-z-7x-10x) — Mathematics III, chapter 5, asked 12×
- [Graphical method max:z=2x₁+3x₂](https://www.bctengineer.com/question.md?key=semester_3%2Fmathematics_iii%3Agraphical-method-max-z-2x-3x) — Mathematics III, chapter 5, asked 12×
- [Graphical method max:Z=4x₁+5x₂](https://www.bctengineer.com/question.md?key=semester_3%2Fmathematics_iii%3Agraphical-method-max-z-4x-5x) — Mathematics III, chapter 5, asked 12×
- [Graphical method max:Z=x₁+1.5x₂](https://www.bctengineer.com/question.md?key=semester_3%2Fmathematics_iii%3Agraphical-method-max-z-x-1) — Mathematics III, chapter 5, asked 12×
- [Graphical max/min min:z=9x+40y](https://www.bctengineer.com/question.md?key=semester_3%2Fmathematics_iii%3Agraphical-max-min-min-z-9x) — Mathematics III, chapter 5, asked 12×
- [Graphical max/min min:Z=5x₁+3x₂](https://www.bctengineer.com/question.md?key=semester_3%2Fmathematics_iii%3Agraphical-max-min-min-z-5x) — Mathematics III, chapter 5, asked 12×

## Related in Mathematics III

- [Simplex method max:Z=3x₁+5x₂](https://www.bctengineer.com/question.md?key=semester_3%2Fmathematics_iii%3Asimplex-method-max-z-3x-5x-two) — Mathematics III, chapter 5, asked 17×
- [Simplex method max:Z=3x₁+5x₂](https://www.bctengineer.com/question.md?key=semester_3%2Fmathematics_iii%3Asimplex-method-max-z-3x-5x) — Mathematics III, chapter 5
- [Big-M method max:P=2x₁+5x₂](https://www.bctengineer.com/question.md?key=semester_3%2Fmathematics_iii%3Abig-m-method-max-p-2x-two) — Mathematics III, chapter 5, asked 15×
- [Big-M method max:P=2x₁+5x₂](https://www.bctengineer.com/question.md?key=semester_3%2Fmathematics_iii%3Abig-m-method-max-p-2x-four) — Mathematics III, chapter 5, asked 3×
- [Big-M method max:P=2x₁+x₂+3x₃](https://www.bctengineer.com/question.md?key=semester_3%2Fmathematics_iii%3Abig-m-method-max-p-2x) — Mathematics III, chapter 5, asked 17×
- [Graphical max/min opt:Z=4x₁+5x₂](https://www.bctengineer.com/question.md?key=semester_3%2Fmathematics_iii%3Agraphical-max-min-opt-z-4x) — Mathematics III, chapter 5

## Related in other subjects

- [EVA graphically; BCWS 9,50,000, BCWP 8,00,000](https://www.bctengineer.com/question.md?key=semester_7%2Fproject_engineering%3Aeva-graphical-bcws-bcwp-as67) — Project Engineering, chapter 4
- [Difference eq x(k+2)+2x(k+1)+3x(k)=0](https://www.bctengineer.com/question.md?key=semester_4%2Fapplied_mathematics%3Adifference-eq-2x1-3x-x0-0-x1-2) — Applied Mathematics, chapter 2, asked 5×
- [Difference equation x(k+2)+3x(k+1)+2x(k)=0](https://www.bctengineer.com/question.md?key=semester_6%2Fdigital_control_system%3Adifference-equation-x0-0-x1-1) — Digital Control System, chapter 2, asked 5×
