Linear programming

1. Linear Programming: It is a technique to find the optimum (maximum or minimum) solution

to a linear function (objective function) of two or more variables subject to some set of linear
inequations (linear constraints).
2. Linear Programming Problem : A linear programming problem is one that is concerned
with finding the optimum value (maximum or minimum value) of a linear function of two or
more variables subject to the constraints that the variables are non-negative and satisfy a
set of linear inequalities.
3. Mathematical Form of LPP : The general mathematical form of a linear programming
problem may be written as follows :

Maximise or Minimise Z=c 1 x 1 +c 2 x 2 +c 3 x 3 +…+ c n x n, where c ' s are constants.

subject to constraints

a11 x 1 +a12 x 2 +a 13 x 3+ …+a 1n x n (≤ ,=, ≥)b 1

a21 x 1 +a22 x 2 +a 23 x 3 +…+a 2 n x n ( ≤1=, ≥ ) b2
… … … … … … … … … … … … … … … … … … … … …..
a m 1 x 1+ am 2 x2 +a m 3 x 3 +…+ amn x n (≤ ,=, ≥) bm
' '
and non-negative restrictions are x 1 ≥ 0 , x 2 ≥ 0 , x 3 ≥ 0 , … x n ≥ 0, where a ij s and b i s are
constants.
4. Important Terms related to LPP :
Constraints : The linear inequations or inequalities or restrictions on the variables of a linear
programming problem are constraints. The conditions x 1 ≥ 0 , x 2 ≥ 0 , x 3 ≥ 0 , … , x n ≥ 0 are called
nonnegative restrictions.
Objective Function : A linear function of two or more variables which has to be maximised or
minimised under the given restrictions is called an objective function. The variables used in
the objective function are called decision variables.
Optimisation Problem : A problem which seeks to maximise or minimise a linear function
subject to certain constraints as determined by a set of linear inequalities is called an
optimisation problem. Linear programming problems are special type of optimisation
problems.
Optimal Value : The maximum or minimum value of an objective function is known as the
optimal value of linear programming problem.
Feasible and Infeasible Region : The common region determined by all the constraints
including non-negative constraints of a linear programming problem is called the feasible
region or solution region. Each point in the feasible region is known as feasible solution. The
region other than feasible region is called an infeasible region.
Bounded and Unbounded Region : A feasible region of a system of linear inequations is said
to be bounded if and only if it can be enclosed within a circle.
Feasible and Infeasible Solution : Points within and on the boundary of the feasible region,
represents feasible solution of the constraints. Any point outside the feasible region
represents an infeasible solution.
Optimal Feasible Solution : A feasible solution at which the objective function has optimal
value (maximum or minimum value), is called the optimal feasible solution of the linear
programming problem.
5. Fundamental Theorems for solving Linear Programming Problem :
Theorem 1 : Let R be the feasible region (convex polygonal) for a linear programming
problem and let Z=ax +by be the objective function. When Z has an optimal value
(maximum or minimum), where the variables x and y are subject to constraints described by
linear inequalities, then this optimal value must occur at a corner point (vertex) of the
feasible region.
Theorem 2 : Let R be the feasible region (convex polygonal) for a linear programming
problem and let Z=ax +by be the objective function. If R is bounded, then Z has both
maximum and minimum value on R and each of these occurs at a corner point (vertex of R).
Note: Maximum or minimum value of the objective function may or may not exist, if the
feasible region is unbounded.
6. Working Rule to solve a Linear Programming Problem : The following steps are used to
solve a LPP:
(1) Write the given LPP in mathematical form by using mathematical formation (if it is not
given in mathematical form).
(2) Consider all linear constraints as linear equations.
(3) Draw the graph of each linear equation obtained in step 2.
(4) Shade the required region of each inequality. The common shaded portion represents the
region of solution, called the feasible region. This region represents the set of all feasible
solutions of the LPP.
(5) Determine the coordinates of the corner points of the feasible region which can be
determined by solving the equations of two lines intersecting at that point.
(6) Evaluate the objective function Z=ax +by at each corner point. Let M and m be,
respectively denote the largest and smallest values of objective function Z at these points.
(7) If the feasible region is bounded, then M and m, respectively are the maximum and
minimum values of the objective function.
(8) If the feasible region is unbounded, then
(a) M is the maximum value of the objective function Z, if the open half plane determined by
ax +by > M has no point in common with the feasible region. Otherwise, Z has no maximum
value.
(b) m is the minimum value of the objective function Z, if the open half plane determined by
ax +by < m has no point in common with the feasible region. Otherwise, Z has no minimum
value.
Note : If two corner points of the feasible region give the same maximum or minimum value,
then any point on the line segment joining these two points also gives an optimal solution of
the same type (maximum or minimum). In this case, every point on the line segment is the
solution of the LPP. In other words, there are infinite solutions of the LPP.
 CASE STUDY BASED QUESTIONS
Case Study/Passage based integrated units of assessment questions carrying 4 marks
each.
1. Read the following passage and answer the questions given below :
A graph is shown below. This graph shows the feasible solution of an Linear Programming
Problem.

Based on the above information, answer the following questions :

(i) Find the equations of lines AB and CD .

(ii) Find the point of intersection E.

(iii) Let Z=2 x +5 y be the objective function. Then, at which point maximum of Z occurs?

Or
Based on above figure write the constraints in terms of x and y.
Sol. (i) Line AB cuts off intercepts 20 and 100 on x - and y-axes respectively.

∴ Equation of line AB is
x y 5x+ y
+ =1 ⇒ =1 ⇒ 5 x+ y=100 ...(1)
20 100 100
Line CD cuts off intercepts 60 and 60 on x-and y-axes respectively.

∴ Equation of line CD is
x y
+ =1 ⇒ x + y=60 ...(2)
60 60
(ii) Subtracting (2) from (1), we get
4 x=40 ⇒ x=10
Putting the value of x in (2), we get
10+ y =60 ⇒ y=50
The point of intersection is E(10 ,50).

(iii)

Corner point (x , y ) of the feasible region Value of objective function

Z=2 x +5 y
O ( 0 , 0) 2(0)+5(0)=0+0=0
A(20 ,0) 2 ( 20 ) +5 ( 0 )=40+0=40
E(10 ,50) 2(10)+5(50)=20 +250=270
D(0 ,60) 2(0)+5( 60)=0+300=300 Maximum

The point where maximum of Z occurs is D(0 ,60).

Or

Clearly, (0 , 0) satisfies 5 x+ y ≤ 100.

Clearly, the shaded area and (0 , 0) lie on the same side of the line 5 x+ y=100.

Therefore, the corresponding constraint is 5 x+ y ≤ 100.

Clearly, (0 , 0) satisfies x + y ≤ 60 .

Clearly, the shaded area and (0 , 0) lie on the same side of the line x + y=60 .

Therefore, the corresponding constraint is x + y ≤ 60 .

The shaded region is above the x-axis and on the right of y-axis, so x ≥ 0 , y ≥0 .

Therefore the constraints are

5 x+ y ≤ 100
x + y ≤ 60
and x ≥ 0 and y ≥ 0

2. Read the following passage and answer the questions given below :
Let R be the feasible region of a linear programming problem and let Z=ax +by be the
objective function. Z has an optimal value (max. or min.) at corner points of the feasible
region.
Based on the above information, answer the following questions :
(i) Define objective function.
(ii) In the linear programming problem : Minimize Z=7 x+ 5 y subject to constraints
x ≥ 8 , y ≥3 , 2 x+ y ≥ 8 , x ≥ 0 and y ≥ 0.
Write redundant constraints.
(iii) Let Z= px+ qy , where p , q>0 be the objective function. Find the condition on p and q so
that the maximum value of Z occurs at (4 , 10) and (6 , 8).
 Or

Corner points of the feasible region determined by the system of linear constraints are (0 , 4 )
, (5 , 0),(8 , 0),(4 , 6) and (0 , 7). Let Z=4 x +6 y be the objective function. Find the point at
which minimum value of Z occurs.
Sol. (i) Objective function is a linear function whose optimum (maximum or minimum) value
is to be found.
(ii) When x ≥ 8 , y ≥3 , then 2 x+ y ≥ 2× 8+3 i.e.; 2 x+ y ≥ 19

Hence, 2 x+ y ≥ 8 , x ≥ 0 and y ≥ 0 are automatically satisfied by every point of the region.

The constraints 2 x+ y ≥ 8 , x ≥ 0 and y ≥ 0 are redundant.

(iii) Z= px+ qy , p , q>0

Since maximum value of Z occurs at (4 , 10) and (6 , 8).

∴ Value of Z =px + qy at (4 , 10)= Value of Z= px+ qy at (6 , 8)

⇒ 4 p+10 q=6 p+8 q
⇒ 2 q=2 p ⇒ q=p
Or
Z=4 x +6 y
Z(0 ,4 )=4(0)+6 (4 )=24

Z(5 ,0) =4 (5)+6(0)=20

Z(8 ,0 )=4 (8)+6 (0)=32

Z(4 , 6)=4(4)+6 (6)=52

Z(0 ,7 )=4 (0)+6(7)=42

The point at which minimum of Z occurs is (5 , 0).

MULTIPLE CHOICE QUESTIONS

Select the most appropriate answer from the given options :

1. If the corner points of the feasible region of an LPP are (0 , 3),(3 ,2) and (0 , 5), then the
minimum value of Z=11 x+ 7 y is [CBSE 2022]

(a) 21 (b) 33 (c) 14 (d) 35

2. The number of solutions of the system of inequations x +2 y ≤ 3 , 3 x + 4 y ≥ 12 , x ≥ 0 , y ≥ 1 is
[CBSE 2022]
(a) 0 (b) 2 (c) finite (d) infinite
3. The maximum value of Z=3 x+ 4 y subject to the constraints x ≥ 0 , y ≥0 and x + y ≤ 1 is
[CBSE 2022]
(a) 7 (b) 4 (c) 3 (d) 10
4. The feasible region of an LPP is given in the following figure :

Then, the constraints of the LPP are x ≥ 0 , y ≥0 and [CBSE 2022]

(a) 2 x+ y ≤ 52 and x +2 y ≤ 76 (b) 2 x+ y ≤ 104 and x +2 y ≤ 76

(c) x +2 y ≤ 104 and 2 x+ y ≤ 76 (d) x +2 y ≤ 104 and 2 x+ y ≤ 38

5. If the minimum value of an objective function Z=ax +by occurs at two points (3 , 4) and
(4 , 3) , then [CBSE 2022]
(a) a+ b=0 (b) a=b (c) 3 a=b (d) a=3 b

6. In the given graph, the feasible region for a LPP is shaded. The objective function
Z=2 x −3 y , will be minimum at : [CBSE Sample Question Paper]

(a) (4 , 10) (b) (6 , 8) (c) (0 , 8) (d) (6 , 5)

7. For the following LPP

Maximise Z=3 x +4 y
subject to constraints x − y ≥−1 , x ≤3
x ≥ 0 , y ≥0
The maximum value is [CBSE 2022]
(a) 0 (b) 4 (c) 25 (d) 30
8. Based on the given shaded region as the feasible region in the graph, at which point(s) is
the objective function Z=3 x+ 9 y maximum ? [CBSE Sample Question Paper]

(a) Point B (b) Point C

(c) Point D (d) Every point on the line segment CD

9. A linear programming problem is as follows:

Minimise Z=30 x+50 y

subject to the constraints,

3 x+ 5 y ≥ 15
2 x+ 3 y ≤ 18
x ≥0 , y ≥ 0
In the feasible region, the minimum value of Z occurs at [CBSE Sample Question Paper]
(a) a unique point (b) no point (c) infinitely many points (d) two points only
10. For an objective function Z=ax +by , where a , b> 0; the comer points of the feasible
region determined by a set of constraints (linear inequalities) are (0 , 20),(10 ,10),(30 , 30)
and (0 , 40). The condition on a and b such that the maximum Z occurs at both the points
(30 , 30) and (0 , 40) is : [CBSE Sample Question Paper]
(a) b−3 a=0 (b) a=3 b (c) a+ 2b=0 (d) 2 a−b=0

11. In a linear programming problem, the constraints on the decision variables x and y are
x−3 y ≥ 0, y ≥ 0 ,0 ≤ x ≤ 3. The feasible region [CBSE Sample Question Paper]
(a) is not in the first quadrant (b) is bounded in the first quadrant
(c) is unbounded in the first quadrant (d) does not exist
12. Comer points of the feasible region determined by the system of linear constraints are
(0 , 3),(1 ,1) and (3 , 0). Let Z= px+ qy , where p , q>0 . Condition on p and q so that the
minimum value of Z occurs at (3 , 0) and (1 , 1) is [NCERT Exemplar]

(a) p=2q (b) p=q (c) p=3 q (d) q=2 p

13. Corner points of the feasible region determined by the system of linear constraints are
(0 , 3),(1 ,1) and (3 , 0). Let Z=4 x +5 y be the objective function. The minimum value of Z
occurs at (a) (0 , 3) only. (b) (3 , 0) only. (c) (1 , 1) only.
(d) any point of the line segment joining the points (1 , 1) and (0 , 3).

14. Corner points of the feasible region determined by the system of linear constraints are
(0 , 2),(3 ,0) ,(6 ,0),(6 , 8) and (0 , 5). Let Z=4 x +6 y be the objective function. The minimum
value of Z occurs at : [NCERT Exemplar]

(a) (6 , 8) only (b) (3 , 0) only (c) (0 , 2) only

(d) any point of the line segment joining the points (0 , 2) and (3 , 0)

15. The point which does not lie in the half-plane 2 x+3 y −12≤ 0 is

(a) (1 , 2) (b) (2 , 1) (c) (2 , 3) (d) (−3 , 2)

16. Variables of the objective function of the linear programming problem are
(a) zero (b) negative (c) zero or positive (d) zero or negative
17. Which of the term is not used in a linear programming problem ?
(a) Optimum solution (b) Feasible solution (c) Concave region (d) Objective function
18. The conditions x ≥ 0 and y ≥ 0 are called

(a) restrictions only. (b) negative restrictions.

(c) non-negative restrictions. (d) none of these.
19. An optimisation problem may involve finding
(a) maximum profit. (b) minimum cost.
(c) minimum use of resources. (d) all of these.
20. The corner points of the feasible region determined by the system of linear constraints
are (0 , 0),(0 , 40),(20 , 40),(60 , 20), (60 , 0) . The objective function is Z=4 x +3 y . [NCERT
Exemplar] Compare the quantity in Column A and Column B
Column A Column B
Maximum of Z 325
(a) The quantity in Column A is greater. (b) The quantity in Column B is greater.
(c) The two quantities are equal.
(d) The relationship cannot be determined on the basis of the information supplied.
21. The optimal value of the objective function is obtained at the points
(a) at the origin. (b) on x-axis.
(c) on y-axis. (d) at corner points of the feasible region.
ANSWERS
1. (a) 2. (a) 3. (b) 4. (b) 5. (b) 6. (c) 7. (c) 8. (d) 9. (c)
10. (a) 11. (b) 12. (d) 13. (c) 14. (d) 15. (c) 16. (c) 17. (c) 18. (c)
19. (d) 20. (b) 21. (d)
 ASSERTION-REASON QUESTIONS
In the questions statements of Assertion (A) is followed by a statement of Reason (R).
Choose the correct option.

(a) Both assertion ( A) and reason (R) are true and reason (R) is the correct explanation of
assertion ( A).

(b) Both assertion ( A) and reason (R) are true, but reason (R) is not the correct explanation
of assertion ( A).

(c) Assertion ( A) is true, but reason (R) is false.

(d) Assertion ( A) is false, but reason (R) is true.

1. Assertion (A) : Feasible region is the set of points which satisfy all the given constraints.
Reason (R) : The optimum value of the objective function is attained at the points of x-axis
only.
2. Assertion (A) : The graph of the inequality 5 x+ 4 y >6 is half plane that neither contains
the origin nor the points of the line 5 x+ 4 y =6.

Reason (R): Neither origin nor the points of the line 5 x+ 4 y =6 satisfy the inequation
5 x+ 4 y >6 .
3. Assertion (A) : The half plane 3 x+ 2 y ≤ 12 does not contain the point (3 , 3).

Reason (R) : The half plane ax +by ≤ c does not contain the point ( x 1 , y 1 ) if the ( x 1 , y 1 )
satisfies the inequation.
4. Assertion (A) : In an LPP, if the objective function Z=ax +by has the same minimum value
on two corner points P and Q of the feasible region, then the number of points at which Z min
occurs is infinite.

Reason (R) : If the objective function Z has the same minimum value on two corner points of
the feasible region, then the objective function Z has the same minimum value at every point
of line segment joining the two corner points.
5. Assertion (A) : If the corner points of the feasible region determined by the system of
linear constraints are (0 , 4 ),(5 ,0), and (4 , 6). Let Z=5 x+2 y be the objective function. The
maximum value of Z is 25.

Reason (R) : Calculate value of objective function Z at each corner point of the feasible
region and then find maximum value.
ANSWERS
1. (c) 2. (a) 3. (c) 4. (a) 5. (d)