Home / Courses / Engineering entrance / Practice / Linear programming

Linear programming

Class 12 · 206 questions and templates for Engineering entrance, in order from warm-up to top rank. Check each answer, then read the full solution.

New to this topic? Read the lesson first: Linear programming.

Loading questions… (they need JavaScript; nothing you type is sent anywhere)

Written questions with solutions

The same questions as a list, so you can print them or read without the practice box. Templates (fresh numbers) appear only in the practice box above.

  1. MCQWarm-up

    A linear programming problem asks you to
    1. solve a single quadratic equation
    2. optimise (maximise or minimise) a linear function subject to linear inequalities
    3. find the area under a curve
    4. maximise a quadratic function with no conditions
    Answer and solution

    Answer: B

    An LPP has a linear objective function and linear constraints (inequalities or equations). The best value is found among the points that satisfy every constraint.

    Why people get this wrong: Both the objective and the constraints must be linear.

  2. MCQWarm-up

    In an LPP, the linear function that is to be maximised or minimised is called the
    1. constraint
    2. feasible region
    3. corner point
    4. objective function
    Answer and solution

    Answer: D

    The function such as Z=3x+2y (profit, cost, etc.) is the objective function. The inequalities are the constraints.

  3. MCQWarm-up

    The conditions x≥0 and y≥0 in an LPP are called
    1. non-negativity restrictions
    2. objective functions
    3. optimal solutions
    4. iso-profit lines
    Answer and solution

    Answer: A

    They say that the quantities cannot be negative, so the feasible region lies in the first quadrant.

  4. MCQWarm-up

    The feasible region of an LPP is
    1. the set of points where Z is largest
    2. the set of points on the x-axis only
    3. the set of points that satisfy all the constraints together
    4. the set of points that satisfy at least one constraint
    Answer and solution

    Answer: C

    A point is feasible only if it satisfies every constraint, so the feasible region is the common part of all the half-planes.

    Why people get this wrong: Every constraint must hold, not just one.

  5. MCQWarm-up

    By the corner point method, the maximum or minimum value of Z over a bounded feasible region occurs at
    1. the centre of the region
    2. a point on the y-axis only
    3. a corner point (vertex) of the region
    4. the origin always
    Answer and solution

    Answer: C

    Z is linear, so on a bounded convex region its extreme values are attained at corner points.

    Why people get this wrong: The origin is a corner only when it is feasible, and it need not be optimal.

  6. MCQWarm-up

    Which of these cannot be a constraint in a linear programming problem?
    1. x2+y≤4
    2. 2x+3y≤5
    3. x−y≥0
    4. y≤7
    Answer and solution

    Answer: A

    Constraints must be linear. x2+y≤4 has x2, so it is not linear.

  7. MCQWarm-up

    Which point lies in the feasible region of x+y≤5, x≥0, y≥0?
    1. (4,3)
    2. (−1,2)
    3. (3,3)
    4. (2,2)
    Answer and solution

    Answer: D

    (2,2): 2+2=4≤5 and both coordinates are ≥0. (4,3) and (3,3) give 7 and 6, above 5. (−1,2) breaks x≥0.

  8. NATWarm-up

    Find the value of Z=3x+4y at the point (2,5).
    Answer and solution

    Answer: 26

    Z=3(2)+4(5)=6+20=26.

  9. NATWarm-up

    Find the value of Z=2x−y at the point (6,4).
    Answer and solution

    Answer: 8

    Z=2(6)−4=12−4=8.

    Why people get this wrong: Do not forget the minus sign on y.

  10. MCQWarm-up

    The corner points of the region x+y≤4, x≥0, y≥0 are
    1. (0,0), (4,4), (0,4)
    2. (0,0), (4,0), (0,4)
    3. (4,0), (0,4) only
    4. (0,0), (2,2), (4,0)
    Answer and solution

    Answer: B

    The region is a triangle bounded by the axes and the line x+y=4. The line meets the axes at (4,0) and (0,4), and the axes meet at (0,0).

    Why people get this wrong: The origin is a corner when it is feasible.

  11. NATWarm-up

    How many corner points does the region 0≤x≤3, 0≤y≤2 have?
    Answer and solution

    Answer: 4

    It is a rectangle with corners (0,0), (3,0), (3,2) and (0,2), so 4 corner points.

  12. MCQWarm-up

    A feasible point at which Z takes its best (largest or smallest, as asked) value is called
    1. an infeasible solution
    2. a constraint
    3. a redundant point
    4. an optimal solution
    Answer and solution

    Answer: D

    An optimal solution is a feasible solution that gives the optimum value of the objective function.

  13. MCQWarm-up

    A feasible region is called bounded if
    1. it contains the origin
    2. it can be enclosed in a circle
    3. it has exactly 4 corner points
    4. it lies in the first quadrant
    Answer and solution

    Answer: B

    Bounded means that the region does not stretch to infinity, so some circle contains it. Otherwise it is unbounded.

    Why people get this wrong: Lying in the first quadrant does not make a region bounded.

  14. MCQWarm-up

    The feasible region of a linear programming problem is always
    1. a circle
    2. a single point
    3. a convex set
    4. a bounded set
    Answer and solution

    Answer: C

    It is the intersection of half-planes, and an intersection of convex sets is convex. It may be unbounded, so it is not always bounded.

    Why people get this wrong: Convex does not mean bounded.

  15. MCQWarm-up

    A worker can work at most 10 hours a day. This is written as
    1. hours ≤10
    2. hours ≥10
    3. hours =10 exactly
    4. hours <0
    Answer and solution

    Answer: A

    "At most" means "not more than", which is ≤.

    Why people get this wrong: "At most" is le and "at least" is ge.

  16. NATWarm-up

    The corner points of a region are (0,0), (5,0) and (0,6). Find the maximum of Z=4x+3y over the region.
    Answer and solution

    Answer: 20

    Z(0,0)=0, Z(5,0)=20, Z(0,6)=18. The maximum is 20.

  17. MCQWarm-up

    The conditions x≥0 and y≥0 alone describe
    1. the whole plane
    2. the first quadrant, including the axes
    3. the line y=x
    4. a bounded triangle
    Answer and solution

    Answer: B

    Both coordinates are non-negative, which is the first quadrant with its boundary axes. It is unbounded.

  18. MCQStandard

    Maximise Z=3x+5y subject to x+y≤8, x+3y≤18, x≥0, y≥0. The optimal value is
    1. 0
    2. 24
    3. 34
    4. 30
    Answer and solution

    Answer: C

    Draw the region and find its corner points. (0,0): Z=0; (8,0): Z=24; (3,5): Z=34; (0,6): Z=30.

    The largest value is 34.

    Why people get this wrong: Check every corner point, not just the intersection of the two lines.

  19. MCQStandard

    Minimise Z=2x+3y subject to x+y≥6, x+3y≥10, x≥0, y≥0. The optimal value is
    1. 20
    2. 18
    3. 15
    4. 14
    Answer and solution

    Answer: D

    Draw the region and find its corner points. (4,2): Z=14; (10,0): Z=20; (0,6): Z=18.

    The region is unbounded, but the coefficients of Z are positive, so the minimum exists and is the smallest value at a corner point.

    The smallest value is 14.

    Why people get this wrong: On an unbounded region, a minimum can exist only when Z grows away from the corners.

  20. NATStandard

    Maximise Z=4x+3y subject to 2x+y≤20, x+2y≤16, x≥0, y≥0. Find the optimal value.
    Answer and solution

    Answer: 44

    Draw the region and find its corner points. (0,0): Z=0; (10,0): Z=40; (8,4): Z=44; (0,8): Z=24.

    The largest value is 44.

    Why people get this wrong: Remember the corners on the axes.

  21. NATStandard

    Minimise Z=3x+y subject to 4x+y≥20, x+y≥8, x≥0, y≥0. Find the optimal value.
    Answer and solution

    Answer: 16

    Draw the region and find its corner points. (4,4): Z=16; (8,0): Z=24; (0,20): Z=20.

    The region is unbounded, but the coefficients of Z are positive, so the minimum exists and is the smallest value at a corner point.

    The smallest value is 16.

  22. NATStandard

    Maximise Z=5x+4y subject to 3x+2y≤24, x+2y≤12, x≥0, y≥0. At the optimal point, find the value of x.
    Answer and solution

    Answer: 6

    Draw the region and find its corner points. (0,0): Z=0; (8,0): Z=40; (6,3): Z=42; (0,6): Z=24.

    The largest value is 42.

    The optimum is at (6,3), so x=6.

  23. NATStandard

    Minimise Z=4x+5y subject to 2x+3y≥12, x+y≥5, x≥0, y≥0. At the optimal point, find the value of y.
    Answer and solution

    Answer: 2

    Draw the region and find its corner points. (3,2): Z=22; (6,0): Z=24; (0,5): Z=25.

    The region is unbounded, but the coefficients of Z are positive, so the minimum exists and is the smallest value at a corner point.

    The smallest value is 22.

    The optimum is at (3,2), so y=2.

  24. MCQStandard

    To shade the region 2x+3y≤12, which side of the line 2x+3y=12 is chosen?
    1. The side containing the origin, because 0≤12 is true
    2. The side not containing the origin
    3. Both sides
    4. Only the line itself
    Answer and solution

    Answer: A

    Test (0,0): 2(0)+3(0)=0≤12 is true, so the origin is on the feasible side.

    Why people get this wrong: Test a point that is not on the line.

  25. MCQStandard

    The lines x+y=5 and x−y=1 meet at
    1. (2,3)
    2. (3,2)
    3. (4,1)
    4. (5,0)
    Answer and solution

    Answer: B

    Add the equations: 2x=6, so x=3 and y=2. Check: 3+2=5 and 3−2=1.

  26. NATStandard

    The lines 2x+y=10 and x+y=7 meet at a point. Find its x-coordinate.
    Answer and solution

    Answer: 3

    Subtract: (2x+y)−(x+y)=10−7 gives x=3 (and then y=4).

  27. MCQStandard

    Assertion (A): The feasible region of an LPP is a convex set.

    Reason (R): The intersection of half-planes is convex.

    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
    Answer and solution

    Answer: A

    Each constraint is a half-plane (convex). The common part of convex sets is convex, so A is true and R explains it.

    Why people get this wrong: A region can be convex and still unbounded.

  28. MCQStandard

    Statement I: If the feasible region is bounded, Z has both a maximum and a minimum on it.

    Statement II: If the feasible region is unbounded, Z never has a minimum on it.

    1. Both Statement I and Statement II are true
    2. Statement I is true and Statement II is false
    3. Statement I is false and Statement II is true
    4. Both Statement I and Statement II are false
    Answer and solution

    Answer: B

    Statement I is true (the extreme value theorem for corner points). Statement II is false: for example, Z=x+y on x+y≥3 has minimum 3 although the region is unbounded.

    Why people get this wrong: Unbounded does not rule out an optimum; it must be checked.

  29. MSQStandard

    Which of these points are feasible for x+y≤6, 2x+y≤8, x≥0, y≥0?
    1. (1,1)
    2. (3,2)
    3. (4,2)
    4. (0,6)
    5. (2,5)
    Answer and solution

    Answer: A, B, D

    (1,1): 2≤6, 3≤8 yes. (3,2): 5≤6, 8≤8 yes. (4,2): 6≤6 but 10>8, no. (0,6): 6≤6, 6≤8 yes. (2,5): 7>6, no.

    Why people get this wrong: Test every constraint for every point.

  30. MSQStandard

    Which statements about the feasible region of an LPP are correct?
    1. It is a convex set.
    2. It may be unbounded.
    3. It always contains the origin.
    4. Every point of it is a corner point.
    Answer and solution

    Answer: A, B

    It is convex and may be unbounded. It need not contain the origin (for example x+y≥3), and only some points are corners.

    Why people get this wrong: The origin is not always feasible.

← All topics