• Foundation
  • About 35 min
  • 15 practice questions

Final self-assessment: Linear Programming

Test yourself on the whole course: 15 questions with answers explained.

If something looks wrong, please tell us.

Attempt all 15 questions in one sitting of about 35 minutes. Sketch the feasible region on rough paper whenever constraints are given, list the corners, and tabulate Z before choosing an option. Then check your answers and read every explanation.

Final self-assessment

  1. 1. Which of the following is NOT allowed in a linear programming problem?

    1. A constraint such as 3x + 2y ≤ 12
    2. An objective function such as Z = 4x − y
    3. A constraint such as xy ≥ 4
    4. The restrictions x ≥ 0, y ≥ 0
    Show answer

    Answer: C. xy ≥ 4 contains the product of the variables, so it is not linear. All constraints and the objective function of an LPP must be linear.

  2. 2. In an LPP, the variables x and y whose values are to be decided are called

    1. decision variables
    2. constraints
    3. corner points
    4. objective variables of degree two
    Show answer

    Answer: A. x and y represent the decisions to be made, such as how many of each item to produce, so they are called decision variables.

  3. 3. Assertion (A): The word 'programming' in linear programming refers to writing computer programs. Reason (R): The word 'linear' means that all the mathematical relations in the problem are linear.

    1. Both A and R are true, and R is the correct explanation of A
    2. Both A and R are true, but R is not the correct explanation of A
    3. A is true, but R is false
    4. A is false, but R is true
    Show answer

    Answer: D. R is true. A is false: 'programming' here means planning a programme or course of action, as in choosing a production plan.

  4. 4. A dealer buys fans at ₹500 each and lamps at ₹250 each, has at most ₹5000, and space for at most 15 items. With x fans and y lamps, the constraints (besides x, y ≥ 0) are

    1. 2x + y ≥ 20, x + y ≥ 15
    2. x + 2y ≤ 20, x + y ≤ 15
    3. 500x + 250y ≤ 15, x + y ≤ 5000
    4. 2x + y ≤ 20, x + y ≤ 15
    Show answer

    Answer: D. Money: 500x + 250y ≤ 5000, which divides by 250 to 2x + y ≤ 20. Space: x + y ≤ 15. Both are 'at most' limits, so ≤.

  5. 5. Food P has 3 units of a vitamin per kg and food Q has 2 units per kg; a diet needs at least 12 units. With x kg of P and y kg of Q, the constraint is

    1. 3x + 2y ≤ 12
    2. 3x + 2y ≥ 12
    3. 2x + 3y ≥ 12
    4. x + y ≥ 12
    Show answer

    Answer: B. Vitamin supplied is 3x + 2y units, and it must be at least 12, so 3x + 2y ≥ 12.

  6. 6. Food P costs ₹6 per kg and food Q costs ₹4 per kg. The objective function for the cheapest diet is

    1. Maximise Z = 6x + 4y
    2. Minimise Z = 4x + 6y
    3. Minimise Z = 6x + 4y
    4. Minimise Z = 10(x + y)
    Show answer

    Answer: C. The cost of x kg of P and y kg of Q is 6x + 4y rupees, and cost is to be minimised.

  7. 7. Which is a corner point of the feasible region of 2x + y ≤ 10, x + 3y ≤ 15, x ≥ 0, y ≥ 0?

    1. (3, 4)
    2. (5, 5)
    3. (0, 10)
    4. (15, 0)
    Show answer

    Answer: A. Solving 2x + y = 10 and x + 3y = 15: y = 10 − 2x, so x + 30 − 6x = 15, x = 3, y = 4. The other points break a constraint: (0, 10) gives x + 3y = 30 > 15 and (15, 0) gives 2x + y = 30 > 10.

  8. 8. Which point is NOT a feasible solution of 2x + y ≤ 10, x + 3y ≤ 15, x ≥ 0, y ≥ 0?

    1. (2, 4)
    2. (4, 3)
    3. (5, 0)
    4. (0, 5)
    Show answer

    Answer: B. For (4, 3): 2(4) + 3 = 11 > 10, so the first constraint fails. (2, 4) gives 8 and 14; (5, 0) gives 10 and 5; (0, 5) gives 5 and 15; all within the limits.

  9. 9. Which system has a bounded feasible region?

    1. x + y ≥ 3, x ≥ 0, y ≥ 0
    2. x − y ≤ 2, x ≥ 0, y ≥ 0
    3. y ≥ 1, x ≥ 0
    4. x + y ≤ 3, x ≥ 0, y ≥ 0
    Show answer

    Answer: D. x + y ≤ 3 in the first quadrant is the triangle with vertices (0, 0), (3, 0) and (0, 3), which fits in a circle. Each of the others extends indefinitely.

  10. 10. Maximise Z = 3x + 5y subject to 2x + y ≤ 10, x + 3y ≤ 15, x ≥ 0, y ≥ 0. What is the maximum value?

    1. 25
    2. 15
    3. 29
    4. 30
    Show answer

    Answer: C. Corners: (0, 0), (5, 0), (3, 4), (0, 5). Values: 0, 15, 9 + 20 = 29, 25. The maximum is 29 at (3, 4).

  11. 11. Over the same region (corners (0, 0), (5, 0), (3, 4), (0, 5)), what is the minimum of Z = x − y?

    1. 0
    2. −1
    3. −5
    4. 5
    Show answer

    Answer: C. Values of x − y: 0, 5, −1, −5. The region is bounded, so the minimum is the smallest corner value, −5 at (0, 5).

  12. 12. The corners of a bounded feasible region are (4, 0), (4, 2), (0, 6) and (0, 2). For Z = 2x + y, which statement is correct?

    1. Maximum 10 at (4, 2); minimum 2 at (0, 2)
    2. Maximum 6 at (0, 6); minimum 2 at (0, 2)
    3. Maximum 10 at (4, 2); minimum 8 at (4, 0)
    4. Maximum 8 at (4, 0); minimum 6 at (0, 6)
    Show answer

    Answer: A. Values: Z(4, 0) = 8, Z(4, 2) = 10, Z(0, 6) = 6, Z(0, 2) = 2. Largest 10 at (4, 2), smallest 2 at (0, 2).

  13. 13. Minimise Z = 5x + 2y subject to 2x + y ≥ 10, x + 2y ≥ 8, x ≥ 0, y ≥ 0. The corners are (0, 10), (4, 2) and (8, 0). What is the minimum value?

    1. 24
    2. 20
    3. 40
    4. It has no minimum
    Show answer

    Answer: B. Values: 0 + 20 = 20, 20 + 4 = 24, 40 + 0 = 40, so m = 20 at (0, 10). The half-plane 5x + 2y < 20 contains no feasible point (every feasible point has 2x + y ≥ 10, and 5x + 2y = 2(2x + y) + x ≥ 20), so 20 is the minimum.

  14. 14. For the same unbounded region, what is true of the maximum of Z = 5x + 2y?

    1. It is 40, at (8, 0)
    2. It is 24, at (4, 2)
    3. It is 20, at (0, 10)
    4. Z has no maximum value
    Show answer

    Answer: D. The largest corner value is 40, but the half-plane 5x + 2y > 40 contains feasible points such as (10, 10). Z grows without limit, so there is no maximum.

  15. 15. Assertion (A): The problem 'Maximise Z = x + y subject to x + y ≤ 2, x + y ≥ 4, x ≥ 0, y ≥ 0' has no optimal solution. Reason (R): No point satisfies all the constraints, so the feasible region is empty.

    1. Both A and R are true, and R is the correct explanation of A
    2. Both A and R are true, but R is not the correct explanation of A
    3. A is true, but R is false
    4. A is false, but R is true
    Show answer

    Answer: A. x + y cannot be at most 2 and at least 4 at once, so the feasible region is empty (R). With no feasible point there is nothing to optimise, which is why A holds.

Questions 1-3: revisit lesson 1 (what an LPP is). Questions 4-6: lesson 2 (formulation). Questions 7-9: lesson 3 (feasible region and corners). Questions 10-12: lesson 4 (corner point method). Questions 13-15: lesson 5 (unbounded regions, multiple and no solutions).

Sign in to keep track of the lessons you finish.

Privacy · Terms · Refunds · Delivery