Skip to content
Mathematics
Class 92025–26 SNC6 Questions SolvedEnglish Medium

Exercise 5.2 — Class 9 Mathematics Solutions

All 6 questions below are worked step by step — every step clearly worked out with mathematical reasons — for the Punjab Board 9th class Mathematics textbook.

Exercise 5.2

6 Questions

Every step explained, with hints and the method used.

Question 1

MediumUnder Review

Maximize f(x,y)=2x+5y; subject to the constraints: 2y−x≤8,x−y≤4,x≥0,y≥0

Hint

To find the optimal solution in linear programming:

  1. Replace inequalities with equality signs to find the boundary lines and their x- and y-intercepts.
  2. Test (0,0) to determine which half-plane satisfies each inequality.
  3. Identify the feasible region in the first quadrant due to x≥0,y≥0.
  4. Find all corner points (vertices) by finding line intersections.
  5. Evaluate f(x,y)=2x+5y at each corner point to identify the maximum value.

Solution

  1. Formulate associated equations and find intercepts.

    Given constraints:

    2y−x≤8— (1)x−y≤4— (2)x≥0,y≥0— (3)
    1. For inequality (1), the associated equation is:
    2y−x=8
    • To find the x-intercept, set y=0:
    2(0)−x=8−x=8x=−8

    So, point A(−8,0) lies on line (1).

    • To find the y-intercept, set x=0:
    2y−0=82y=8y=4

    So, point B(0,4) lies on line (1).

    1. For inequality (2), the associated equation is:
    x−y=4
    • To find the x-intercept, set y=0:
    x−0=4x=4

    So, point C(4,0) lies on line (2).

    • To find the y-intercept, set x=0:
    0−y=4−y=4y=−4

    So, point D(0,−4) lies on line (2).


  2. Perform test point check at (0,0).

    • For inequality (1), substitute (0,0):
    2(0)−(0)≤80≤8(True)

    Since the statement is true, the closed half-plane of 2y−x≤8 contains the origin (0,0) (the region below the line 2y−x=8).

    • For inequality (2), substitute (0,0):
    (0)−(0)≤40≤4(True)

    Since the statement is true, the closed half-plane of x−y≤4 contains the origin (0,0) (the region above the line x−y=4).


  3. Determine the feasible region.

    The non-negative constraints x≥0 and y≥0 restrict the feasible region entirely to the first quadrant. The intersection of the shaded half-planes in the first quadrant forms a closed polygonal feasible region bounded by the coordinate axes and the boundary lines.


  4. Find all corner points (vertices) of the feasible region.

    1. The origin:
    O(0,0)
    1. On the x-axis (y=0):
    C(4,0)
    1. On the y-axis (x=0):
    B(0,4)
    1. Intersection point E of the lines 2y−x=8 and x−y=4: Solve simultaneously:
    −x+2y=8— (i)x−y=4— (ii)

    Adding equations (i) and (ii):

    (−x+2y)+(x−y)=8+4y=12

    Substitute y=12 into equation (ii):

    x−12=4x=4+12x=16

    Thus, the point of intersection is E(16,12).

    The corner points of the feasible region are:

    O(0,0),C(4,0),E(16,12),B(0,4)
  5. Evaluate the objective function f(x,y)=2x+5y at each corner point.

    Corner Point (x,y)Objective Function f(x,y)=2x+5yValue
    O(0,0)f(0,0)=2(0)+5(0)=0+00
    C(4,0)f(4,0)=2(4)+5(0)=8+08
    B(0,4)f(0,4)=2(0)+5(4)=0+2020
    E(16,12)f(16,12)=2(16)+5(12)=32+6092

  6. Conclude the optimal solution.

    Comparing all evaluated values, the maximum value of the objective function is 92, which occurs at the corner point (16,12).

Answer

Maximum value of f(x,y)=92 at corner point (16,12)

Quick Solution

Question 2

MediumUnder Review

Maximize f(x,y)=x+3y; subject to the constraints: 2x+5y≤30,5x+4y≤20,x≥0,y≥0

Hint

To find the optimal solution:

  1. Find intercepts for both boundary lines: 2x+5y=30 has intercepts (15,0) and (0,6); 5x+4y=20 has intercepts (4,0) and (0,5).
  2. Test (0,0) for each constraint.
  3. Since 5x+4y≤20 is more restrictive in the first quadrant, the feasible region vertices are O(0,0), C(4,0), and D(0,5).
  4. Evaluate f(x,y)=x+3y at each vertex to find the maximum value.

Solution

  1. Formulate associated equations and find intercepts.

    Given constraints:

    2x+5y≤30— (1)5x+4y≤20— (2)x≥0,y≥0— (3)
    1. For inequality (1), the associated equation is:
    2x+5y=30
    • To find the x-intercept, set y=0:
    2x+5(0)=302x=30x=15

    So, point A(15,0) lies on line (1).

    • To find the y-intercept, set x=0:
    2(0)+5y=305y=30y=6

    So, point B(0,6) lies on line (1).

    1. For inequality (2), the associated equation is:
    5x+4y=20
    • To find the x-intercept, set y=0:
    5x+4(0)=205x=20x=4

    So, point C(4,0) lies on line (2).

    • To find the y-intercept, set x=0:
    5(0)+4y=204y=20y=5

    So, point D(0,5) lies on line (2).


  2. Perform test point check at (0,0).

    • For inequality (1), substitute (0,0):
    2(0)+5(0)≤300≤30(True)

    The closed half-plane of 2x+5y≤30 contains the origin (0,0).

    • For inequality (2), substitute (0,0):
    5(0)+4(0)≤200≤20(True)

    The closed half-plane of 5x+4y≤20 contains the origin (0,0).


  3. Determine the feasible region.

    The non-negative constraints x≥0,y≥0 restrict the feasible region to the first quadrant. Notice that throughout the first quadrant, the line 5x+4y=20 lies strictly inside (closer to the origin than) the line 2x+5y=30. Specifically, at the intercepts:

    x-intercepts: 4<15y-intercepts: 5<6

    The intersection of the two lines occurs at (−2017,11017), where x<0 (Quadrant II), so they do not intersect inside Quadrant I. Therefore, the constraint 5x+4y≤20 fully defines the outer boundary of the feasible region in the first quadrant.


  4. Find all corner points (vertices) of the feasible region.

    The vertices of the triangular feasible region are:

    1. The origin:
    O(0,0)
    1. On the x-axis:
    C(4,0)
    1. On the y-axis:
    D(0,5)
  5. Evaluate the objective function f(x,y)=x+3y at each corner point.

    Corner Point (x,y)Objective Function f(x,y)=x+3yValue
    O(0,0)f(0,0)=0+3(0)=0+00
    C(4,0)f(4,0)=4+3(0)=4+04
    D(0,5)f(0,5)=0+3(5)=0+1515

  6. Conclude the optimal solution.

    Comparing all evaluated values, the maximum value of the objective function is 15, which occurs at the corner point (0,5).

Answer

Maximum value of f(x,y)=15 at corner point (0,5)

Quick Solution

Question 3

MediumUnder Review

Maximize z=2x+3y; subject to the constraints: 2x+y≤4,4x−y≤2,x≥0,y≥0

Hint

To find the optimal solution:

  1. Determine boundary equations and intercepts: 2x+y=4 has intercepts (2,0) and (0,4); 4x−y=2 has intercepts (12,0) and (0,−2).
  2. Test (0,0) in both inequalities.
  3. Solve the simultaneous equations to find the intersection point E(1,2).
  4. Evaluate z=2x+3y at all four vertices O(0,0), C(12,0), E(1,2), and B(0,4).

Solution

  1. Formulate associated equations and find intercepts.

    Given constraints:

    2x+y≤4— (1)4x−y≤2— (2)x≥0,y≥0— (3)
    1. For inequality (1), the associated equation is:
    2x+y=4
    • To find the x-intercept, set y=0:
    2x+0=42x=4x=2

    So, point A(2,0) lies on line (1).

    • To find the y-intercept, set x=0:
    2(0)+y=4y=4

    So, point B(0,4) lies on line (1).

    1. For inequality (2), the associated equation is:
    4x−y=2
    • To find the x-intercept, set y=0:
    4x−0=24x=2x=12

    So, point C(12,0) lies on line (2).

    • To find the y-intercept, set x=0:
    4(0)−y=2−y=2y=−2

    So, point D(0,−2) lies on line (2).


  2. Perform test point check at (0,0).

    • For inequality (1), substitute (0,0):
    2(0)+(0)≤40≤4(True)

    The closed half-plane contains the origin (0,0).

    • For inequality (2), substitute (0,0):
    4(0)−(0)≤20≤2(True)

    The closed half-plane contains the origin (0,0).


  3. Determine the feasible region.

    The non-negative constraints x≥0,y≥0 restrict the feasible region to the first quadrant. The feasible region is bounded by:

    • The y-axis (x=0) from y=0 to y=4
    • The line 2x+y=4 from (0,4) to the intersection point E(1,2)
    • The line 4x−y=2 from E(1,2) to C(12,0)
    • The x-axis (y=0) from C(12,0) to O(0,0)

  4. Find all corner points (vertices) of the feasible region.

    1. The origin:
    O(0,0)
    1. Point on the x-axis: Since 4x−y≤2 requires x≤12 when y=0:
    C(12,0)
    1. Point on the y-axis:
    B(0,4)
    1. Intersection point E of the lines 2x+y=4 and 4x−y=2: Solve simultaneously:
    2x+y=4— (i)4x−y=2— (ii)

    Adding equations (i) and (ii):

    (2x+y)+(4x−y)=4+26x=6x=1

    Substitute x=1 into equation (i):

    2(1)+y=42+y=4y=2

    Thus, the intersection point is E(1,2).

    The corner points are:

    O(0,0),C(12,0),E(1,2),B(0,4)
  5. Evaluate the objective function z=2x+3y at each corner point.

    Corner Point (x,y)Objective Function z=2x+3yValue
    O(0,0)z=2(0)+3(0)=0+00
    C(12,0)z=2(12)+3(0)=1+01
    E(1,2)z=2(1)+3(2)=2+68
    B(0,4)z=2(0)+3(4)=0+1212

  6. Conclude the optimal solution.

    Comparing all evaluated values, the maximum value of the objective function is 12, which occurs at the corner point (0,4).

Answer

Maximum value of z=12 at corner point (0,4)

Quick Solution

Question 4

MediumUnder Review

Minimize z=2x+y; subject to the constraints: x+y≥3,7x+5y≤35,x≥0,y≥0

Hint

To find the minimum value in linear programming:

  1. Determine the intercepts of each boundary line: x+y=3 gives (3,0) and (0,3); 7x+5y=35 gives (5,0) and (0,7).
  2. Test (0,0) to find which side of each line to shade: x+y≥3 is away from origin, 7x+5y≤35 includes origin.
  3. The feasible region vertices in the first quadrant are A(3,0), C(5,0), D(0,7), and B(0,3).
  4. Evaluate z=2x+y at each vertex to locate the minimum value.

Solution

  1. Formulate associated equations and find intercepts.

    Given constraints:

    x+y≥3— (1)7x+5y≤35— (2)x≥0,y≥0— (3)
    1. For inequality (1), the associated equation is:
    x+y=3
    • To find the x-intercept, set y=0:
    x+0=3x=3

    So, point A(3,0) lies on line (1).

    • To find the y-intercept, set x=0:
    0+y=3y=3

    So, point B(0,3) lies on line (1).

    1. For inequality (2), the associated equation is:
    7x+5y=35
    • To find the x-intercept, set y=0:
    7x+5(0)=357x=35x=5

    So, point C(5,0) lies on line (2).

    • To find the y-intercept, set x=0:
    7(0)+5y=355y=35y=7

    So, point D(0,7) lies on line (2).


  2. Perform test point check at (0,0).

    • For inequality (1), substitute (0,0):
    (0)+(0)≥30≥3(False)

    The closed half-plane does not include the origin (0,0) (the region lies on and above the line x+y=3).

    • For inequality (2), substitute (0,0):
    7(0)+5(0)≤350≤35(True)

    The closed half-plane contains the origin (0,0) (the region lies on and below the line 7x+5y=35).


  3. Determine the feasible region.

    The non-negative constraints x≥0,y≥0 restrict the feasible region to the first quadrant. In the first quadrant, the feasible region is the quadrilateral region lying between the two boundary lines x+y=3 and 7x+5y=35, bounded by:

    • The x-axis segment between x=3 and x=5
    • The line 7x+5y=35
    • The y-axis segment between y=3 and y=7
    • The line x+y=3

  4. Find all corner points (vertices) of the feasible region.

    The vertices of the feasible region are:

    1. A(3,0) (on the x-axis)
    2. C(5,0) (on the x-axis)
    3. D(0,7) (on the y-axis)
    4. B(0,3) (on the y-axis)

  5. Evaluate the objective function z=2x+y at each corner point.

    Corner Point (x,y)Objective Function z=2x+yValue
    A(3,0)z=2(3)+0=6+06
    C(5,0)z=2(5)+0=10+010
    D(0,7)z=2(0)+7=0+77
    B(0,3)z=2(0)+3=0+33

  6. Conclude the optimal solution.

    Comparing all evaluated values, the minimum value of the objective function is 3, which occurs at the corner point (0,3).

Answer

Minimum value of z=3 at corner point (0,3)

Quick Solution

Question 5

MediumUnder Review

Maximize the function defined as; f(x,y)=2x+3y subject to the constraints: 2x+y≤10,x+2y≤14,x≥0,y≥0

Hint

To find the optimal solution:

  1. Formulate associated equations: 2x+y=10 has intercepts (5,0) and (0,10); x+2y=14 has intercepts (14,0) and (0,7).
  2. Test (0,0) in both inequalities.
  3. Solve the equations simultaneously to get the intersection point E(2,6).
  4. The corner points in the first quadrant are O(0,0), A(5,0), E(2,6), and D(0,7).
  5. Evaluate f(x,y)=2x+3y at each corner point to identify the maximum value.

Solution

  1. Formulate associated equations and find intercepts.

    Given constraints:

    2x+y≤10— (1)x+2y≤14— (2)x≥0,y≥0— (3)
    1. For inequality (1), the associated equation is:
    2x+y=10
    • To find the x-intercept, set y=0:
    2x+0=102x=10x=5

    So, point A(5,0) lies on line (1).

    • To find the y-intercept, set x=0:
    2(0)+y=10y=10

    So, point B(0,10) lies on line (1).

    1. For inequality (2), the associated equation is:
    x+2y=14
    • To find the x-intercept, set y=0:
    x+2(0)=14x=14

    So, point C(14,0) lies on line (2).

    • To find the y-intercept, set x=0:
    0+2y=142y=14y=7

    So, point D(0,7) lies on line (2).


  2. Perform test point check at (0,0).

    • For inequality (1), substitute (0,0):
    2(0)+(0)≤100≤10(True)

    The closed half-plane contains the origin (0,0).

    • For inequality (2), substitute (0,0):
    (0)+2(0)≤140≤14(True)

    The closed half-plane contains the origin (0,0).


  3. Determine the feasible region.

    The non-negative constraints x≥0,y≥0 restrict the feasible region to the first quadrant. The feasible region is bounded by the axes and both boundary lines, forming a 4-sided polygon with vertices at the origin, the x-axis, the intersection of both lines, and the y-axis.


  4. Find all corner points (vertices) of the feasible region.

    1. The origin:
    O(0,0)
    1. Point on the x-axis: Comparing x-intercepts (5 vs 14), the region is restricted by x≤5:
    A(5,0)
    1. Point on the y-axis: Comparing y-intercepts (10 vs 7), the region is restricted by y≤7:
    D(0,7)
    1. Intersection point E of the lines 2x+y=10 and x+2y=14: Solve simultaneously:
    2x+y=10— (i)x+2y=14— (ii)

    Multiply equation (i) by 2:

    4x+2y=20— (iii)

    Subtract equation (ii) from equation (iii):

    (4x+2y)−(x+2y)=20−143x=6x=2

    Substitute x=2 into equation (i):

    2(2)+y=104+y=10y=6

    Thus, the intersection point is E(2,6).

    The corner points are:

    O(0,0),A(5,0),E(2,6),D(0,7)
  5. Evaluate the objective function f(x,y)=2x+3y at each corner point.

    Corner Point (x,y)Objective Function f(x,y)=2x+3yValue
    O(0,0)f(0,0)=2(0)+3(0)=0+00
    A(5,0)f(5,0)=2(5)+3(0)=10+010
    E(2,6)f(2,6)=2(2)+3(6)=4+1822
    D(0,7)f(0,7)=2(0)+3(7)=0+2121

  6. Conclude the optimal solution.

    Comparing all evaluated values, the maximum value of the objective function is 22, which occurs at the corner point (2,6).

Answer

Maximum value of f(x,y)=22 at corner point (2,6)

Quick Solution

Question 6

HardUnder Review

Find minimum and maximum values of z=3x+y; subject to the constraints: 3x+5y≥15,x+3y≤9,x≥0,y≥0

Hint

To find both minimum and maximum values of the objective function:

  1. Formulate associated equations: 3x+5y=15 has intercepts (5,0) and (0,3); x+3y=9 has intercepts (9,0) and (0,3).
  2. Test (0,0) to determine the shaded region for each inequality.
  3. Identify the triangular feasible region with corner points B(0,3), A(5,0), and C(9,0).
  4. Evaluate z=3x+y at all three corner points to find the minimum and maximum values.

Solution

  1. Formulate associated equations and find intercepts.

    Given constraints:

    3x+5y≥15— (1)x+3y≤9— (2)x≥0,y≥0— (3)
    1. For inequality (1), the associated equation is:
    3x+5y=15
    • To find the x-intercept, set y=0:
    3x+5(0)=153x=15x=5

    So, point A(5,0) lies on line (1).

    • To find the y-intercept, set x=0:
    3(0)+5y=155y=15y=3

    So, point B(0,3) lies on line (1).

    1. For inequality (2), the associated equation is:
    x+3y=9
    • To find the x-intercept, set y=0:
    x+3(0)=9x=9

    So, point C(9,0) lies on line (2).

    • To find the y-intercept, set x=0:
    0+3y=93y=9y=3

    So, point B(0,3) lies on line (2).

    (Notice that both boundary lines share the same y-intercept B(0,3), which is their point of intersection).


  2. Perform test point check at (0,0).

    • For inequality (1), substitute (0,0):
    3(0)+5(0)≥150≥15(False)

    The closed half-plane does not include the origin (0,0) (the region lies on and above line 1).

    • For inequality (2), substitute (0,0):
    0+3(0)≤90≤9(True)

    The closed half-plane contains the origin (0,0) (the region lies on and below line 2).


  3. Determine the feasible region.

    The non-negative constraints x≥0,y≥0 restrict the feasible region to the first quadrant. In the first quadrant:

    • The region lies above 3x+5y=15 and below x+3y=9.
    • On the x-axis (y=0), the region spans between x=5 and x=9, defined by the segment connecting A(5,0) and C(9,0).
    • On the y-axis (x=0), both boundaries meet at the single vertex B(0,3).
    • Thus, the feasible region is a closed triangle bounded by the points B(0,3), A(5,0), and C(9,0).

  4. Find all corner points (vertices) of the feasible region.

    The three corner points of the feasible region are:

    1. B(0,3) (common y-intercept and line intersection)
    2. A(5,0) (x-intercept of 3x+5y=15)
    3. C(9,0) (x-intercept of x+3y=9)

  5. Evaluate the objective function z=3x+y at each corner point.

    Corner Point (x,y)Objective Function z=3x+yValue
    B(0,3)z=3(0)+3=0+33
    A(5,0)z=3(5)+0=15+015
    C(9,0)z=3(9)+0=27+027

  6. Conclude the optimal solution.

    Comparing all evaluated values:

    • The minimum value of z is 3, which occurs at the corner point (0,3).
    • The maximum value of z is 27, which occurs at the corner point (9,0).

Answer

Minimum value of z=3 at (0,3); Maximum value of z=27 at (9,0)

Quick Solution

The exercises and question numbering reproduced on these pages are from Mathematics for Class 9 (National Curriculum of Pakistan 2023), published by the Punjab Curriculum and Textbook Board (PCTB), Lahore, authored by Muhammad Akhtar Shirani, Madiha Mahmood, and Ghulam Murtaza. PCTB holds the copyright in the original textbook. PrepSure is not affiliated with, endorsed by, or sponsored by PCTB. The worked solutions, explanations, hints and method notes are PrepSure's own original work, written and reviewed by our team. If you hold rights in this material and believe anything here exceeds fair use, write to us and we will take it down.

Rights holder with a concern about this page? copyright@prepsure.pk