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.
-
MCQWarm-up
A linear programming problem asks you to- solve a single quadratic equation
- optimise (maximise or minimise) a linear function subject to linear inequalities
- find the area under a curve
- 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.
-
MCQWarm-up
In an LPP, the linear function that is to be maximised or minimised is called the- constraint
- feasible region
- corner point
- objective function
Answer and solution
Answer: D
The function such as (profit, cost, etc.) is the objective function. The inequalities are the constraints.
-
MCQWarm-up
The conditions and in an LPP are called- non-negativity restrictions
- objective functions
- optimal solutions
- 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.
-
MCQWarm-up
The feasible region of an LPP is- the set of points where is largest
- the set of points on the -axis only
- the set of points that satisfy all the constraints together
- 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.
-
MCQWarm-up
By the corner point method, the maximum or minimum value of over a bounded feasible region occurs at- the centre of the region
- a point on the -axis only
- a corner point (vertex) of the region
- the origin always
Answer and solution
Answer: C
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.
-
MCQWarm-up
Which of these cannot be a constraint in a linear programming problem?Answer and solution
Answer: A
Constraints must be linear. has , so it is not linear.
-
MCQWarm-up
Which point lies in the feasible region of , , ?Answer and solution
Answer: D
: and both coordinates are . and give and , above . breaks .
-
NATWarm-up
Find the value of at the point .Answer and solution
Answer: 26
.
-
NATWarm-up
Find the value of at the point .Answer and solution
Answer: 8
.
Why people get this wrong: Do not forget the minus sign on .
-
MCQWarm-up
The corner points of the region , , are- only
Answer and solution
Answer: B
The region is a triangle bounded by the axes and the line . The line meets the axes at and , and the axes meet at .
Why people get this wrong: The origin is a corner when it is feasible.
-
NATWarm-up
How many corner points does the region , have?Answer and solution
Answer: 4
It is a rectangle with corners , , and , so corner points.
-
MCQWarm-up
A feasible point at which takes its best (largest or smallest, as asked) value is called- an infeasible solution
- a constraint
- a redundant point
- an optimal solution
Answer and solution
Answer: D
An optimal solution is a feasible solution that gives the optimum value of the objective function.
-
MCQWarm-up
A feasible region is called bounded if- it contains the origin
- it can be enclosed in a circle
- it has exactly corner points
- 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.
-
MCQWarm-up
The feasible region of a linear programming problem is always- a circle
- a single point
- a convex set
- 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.
-
MCQWarm-up
A worker can work at most hours a day. This is written as- hours
- hours
- hours exactly
- hours
Answer and solution
Answer: A
"At most" means "not more than", which is .
Why people get this wrong: "At most" is and "at least" is .
-
NATWarm-up
The corner points of a region are , and . Find the maximum of over the region.Answer and solution
Answer: 20
, , . The maximum is .
-
MCQWarm-up
The conditions and alone describe- the whole plane
- the first quadrant, including the axes
- the line
- 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.
-
MCQStandard
Maximise subject to , , . The optimal value isAnswer and solution
Answer: C
Draw the region and find its corner points. : ; : ; : ; : .
The largest value is .
Why people get this wrong: Check every corner point, not just the intersection of the two lines.
-
MCQStandard
Minimise subject to , , . The optimal value isAnswer and solution
Answer: D
Draw the region and find its corner points. : ; : ; : .
The region is unbounded, but the coefficients of are positive, so the minimum exists and is the smallest value at a corner point.
The smallest value is .
Why people get this wrong: On an unbounded region, a minimum can exist only when grows away from the corners.
-
NATStandard
Maximise subject to , , . Find the optimal value.Answer and solution
Answer: 44
Draw the region and find its corner points. : ; : ; : ; : .
The largest value is .
Why people get this wrong: Remember the corners on the axes.
-
NATStandard
Minimise subject to , , . Find the optimal value.Answer and solution
Answer: 16
Draw the region and find its corner points. : ; : ; : .
The region is unbounded, but the coefficients of are positive, so the minimum exists and is the smallest value at a corner point.
The smallest value is .
-
NATStandard
Maximise subject to , , . At the optimal point, find the value of .Answer and solution
Answer: 6
Draw the region and find its corner points. : ; : ; : ; : .
The largest value is .
The optimum is at , so .
-
NATStandard
Minimise subject to , , . At the optimal point, find the value of .Answer and solution
Answer: 2
Draw the region and find its corner points. : ; : ; : .
The region is unbounded, but the coefficients of are positive, so the minimum exists and is the smallest value at a corner point.
The smallest value is .
The optimum is at , so .
-
MCQStandard
To shade the region , which side of the line is chosen?- The side containing the origin, because is true
- The side not containing the origin
- Both sides
- Only the line itself
Answer and solution
Answer: A
Test : is true, so the origin is on the feasible side.
Why people get this wrong: Test a point that is not on the line.
-
MCQStandard
The lines and meet atAnswer and solution
Answer: B
Add the equations: , so and . Check: and .
-
NATStandard
The lines and meet at a point. Find its -coordinate.Answer and solution
Answer: 3
Subtract: gives (and then ).
-
MCQStandard
Assertion (A): The feasible region of an LPP is a convex set.
Reason (R): The intersection of half-planes is convex.
- Both A and R are true and R is the correct explanation of A
- Both A and R are true but R is not the correct explanation of A
- A is true but R is false
- 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.
-
MCQStandard
Statement I: If the feasible region is bounded, has both a maximum and a minimum on it.
Statement II: If the feasible region is unbounded, never has a minimum on it.
- Both Statement I and Statement II are true
- Statement I is true and Statement II is false
- Statement I is false and Statement II is true
- 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, on has minimum although the region is unbounded.
Why people get this wrong: Unbounded does not rule out an optimum; it must be checked.
-
MSQStandard
Which of these points are feasible for , , , ?Answer and solution
Answer: A, B, D
: , yes. : , yes. : but , no. : , yes. : , no.
Why people get this wrong: Test every constraint for every point.
-
MSQStandard
Which statements about the feasible region of an LPP are correct?- It is a convex set.
- It may be unbounded.
- It always contains the origin.
- 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 ), and only some points are corners.
Why people get this wrong: The origin is not always feasible.