PYQ Vault

Day 168: CBSE Class 12 Maths

5 questions. Try each one first, then open its answer.

  1. Question 1

    Linear Programming. Asked once: 2026 (same type asked 4 times)

    29
    Solve the following Linear Programming Problem graphically : Maximize Z=20x+10yZ = 20x + 10y subject to constraints x+2y≤28x + 2y \leq 28 3x+y≤243x + y \leq 24 x≥2x \geq 2 x,y≥0x, y \geq 0

  2. Question 2

    Linear Programming. Asked once: 2025 (same type asked 4 times)

    29
    Consider the Linear Programming Problem, where the objective function Z=(x+4y)Z = (x + 4y) needs to be minimized subject to constraints 2x+y≥10002x + y \ge 1000 x+2y≥800x + 2y \ge 800 x, y≥0x,\ y \ge 0. Draw a neat graph of the feasible region and find the minimum value of Z.

  3. Question 3

    Linear Programming. Asked once: 2024 (same type asked 4 times)

    17
    Of the following, which group of constraints represents the feasible region given below ?

    Tap an option to check your answer.

  4. Question 4

    Linear Programming. Asked once: 2025 (same type asked 4 times)

    18
    The corner points of the feasible region of a Linear Programming Problem are (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5). If Z = ax + by; (a, b > 0) be the objective function, and maximum value of Z is obtained at (0, 2) and (3, 0), then the relation between a and b is :

    Tap an option to check your answer.

  5. Question 5

    Linear Programming. Asked once: 2025 (same type asked 4 times)

    24
    In a Linear Programming Problem, the objective function Z=5x+4yZ = 5x + 4y needs to be maximised under constraints 3x+y≤63x + y \le 6, x≤1x \le 1, x, y≥0x,\ y \ge 0. Express the LPP on the graph and shade the feasible region and mark the corner points.