Scribd
Upload
3 views

12 Linear Programming

The document provides solutions for various linear programming problems from NCERT Class 12 Maths, focusing on maximizing or minimizing objective functions subject to given constraints. It details the feasible regions, corner points, and the corresponding values of the objective function for each exercise. The document concludes with cases where maximum or minimum values cannot be determined due to unbounded or nonexistent feasible regions.

Uploaded by

sheedh11042008
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
3 views

12 Linear Programming

The document provides solutions for various linear programming problems from NCERT Class 12 Maths, focusing on maximizing or minimizing objective functions subject to given constraints. It details the feasible regions, corner points, and the corresponding values of the objective function for each exercise. The document concludes with cases where maximum or minimum values cannot be determined due to unbounded or nonexistent feasible regions.

Uploaded by

sheedh11042008
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 11

NCERT Solutions for Class 12

Maths
Chapter 12 – Linear Programming

Exercise 12.1

1. Maximize Z  3x  4y
Subject to the constraints: x  y  4 , x  0 , y  0
Ans:
The given constraints are, x  y  4 , x  0 , y  0 , and the feasible region which
is in accordance with the given constraints is

The points at the corners in the feasible region are O (0, 0), A (4, 0), and B (0, 4).
Z assumes the following values on these points.

Class XII Maths www.vedantu.com 1


Thus, the maximum value of Z is 16 at the point B (0,4).

2. Minimize Z  3x  4y subject to x  2y  8 , 3x  2y  12 , x  0 , y  0


Ans:
The given constraints are, x  2y  8 , 3x  2y  12 , x  0 and y  0 , and the
feasible region which is in accordance with the given constraints is

The points at the corners in the feasible region are O (0, 0), A (4, 0), B (2, 3), and
C (0, 4). Z assumes the following values on these points.

Class XII Maths www.vedantu.com 2


Thus, the minimum value of Z is -12 at the point (4, 0).

3. Maximize Z  5x  3y subject to 3x  5y  15 , 5x  2y  10 , x  0 , y  0 .
Ans:
The given constraints are, 3x  5y  15 , 5x  2y  10 , x  0 , and y  0 , and the
feasible region which is in accordance with the given constraints is

Class XII Maths www.vedantu.com 3


The points at the corners in the feasible region are O (0, 0), A (2, 0), B (0, 3), and
 20 45 
C  ,  . Z assumes the following values on these points.
 19 19 

235  20 45 
Thus, the maximum value of Z is at the point  , .
19  19 19 

4. Minimize Z  3x  5y such that x  3y  3 , x  y  2 , x,y  0


Ans:
The given constraints are, x  3y  3 , x  y  2 , and x, y  0 , and the feasible
region which is in accordance with the given constraints is

Class XII Maths www.vedantu.com 4


We can see that the feasible region is not bounded.
3 1
The points at the corners in the feasible region are A (3, 0), B  ,  , and C (0,
2 2
2). Z assumes the following values on these points.

Since the feasible region is unbounded, we cannot be sure that 7 is the minimum
value of Z. To confirm this, we need to sketch the graph of the inequality,
3x  5y  7 , and see if the resulting plane has any point in common with the
feasible region.
From the graph that we sketched, we can see that there is no common point
between feasible regions and the sketched inequality 3x  5y  7 .
3 1
Z achieves minimum value 7 at  ,  .
2 2

5. Maximize Z  3x  2y subject to x  2y  10 , 3x  y  15 , x,y  0 .


Ans:
The given constraints are, x  2y  10 , 3x  y  15 , x  0 , and y  0 , and the
feasible region which is in accordance with the given constraints is

Class XII Maths www.vedantu.com 5


The points at the corners in the feasible region are A (5, 0), B (4, 3), and C (0, 5).
Z assumes the following values on these points.

Z achieves maximum value 18 at (4,3).

6. Minimize Z  x  2y subject to 2x  y  3 , x  2y  6 , x,y  0 .


Ans:
The given constraints are, 2x  y  3 , x  2y  6 , x  0 , and y  0 , and the
feasible region which is in accordance with the given constraints is

Class XII Maths www.vedantu.com 6


The points at the corners in the feasible region are A (6, 0) and B (0, 3). Z assumes
the following values on these points.

We can see that the value of Z is the same on both A and B hence, we will need
to check on the other point on the line x  2y  6 as well. The value of Z is 6 at
point (2,2) also. Hence, the minimum value of Z Occurs at more than two points
Thus, the value of Z is minimum at every point on the line, x  2y  6

7. Minimize and Maximize Z  5x  10y subject to x  2y  120 , x  y  60 ,


x  2y  0 , x,y  0 .
Ans:
The given constraints are, x  2y  120 , x  y  60 , x  2y  0 , x  0 , and y  0
, and the feasible region which is in accordance with the given constraints is

Class XII Maths www.vedantu.com 7


The points at the corners in the feasible region are A (60, 0), B (120, 0), C (60,
30), and D (40, 20). Z assumes the following values on these points.

Z achieves maximum and minimum values as 600 and 300 respectively. The point
of maximum value is all the points on the line segment joining (120, 0) and (60,
30) and minimum value is (60,0).

8. Minimize and Maximize Z  x  2y subject to x  2y  100 , 2x  y  0 ,


2x  y  200 , x,y  0 .
Ans:
The given constraints are, x  2y  100 , 2x  y  0 , 2x  y  200 , x  0 , and
y  0 , and the feasible region which is in accordance with the given constraints is

Class XII Maths www.vedantu.com 8


The points at the corners in the feasible region are A(0, 50), B(20, 40), C(50, 100),
and D(0, 200). Z assumes the following values on these points.

Z achieves maximum and minimum values as 400 and 100 respectively. The point
of maximum value is (0,200) and minimum value is all points on the line joining
the points (0, 50) and (20, 40).

9. Maximize Z   x  2y , subject to the constraints: x  3 , x  y  5 ,


x  2y  6 , y  0 .
Ans:
The given constraints are, x  3 , x  y  5 , x  2y  6 , and y  0 and the feasible
region which is in accordance with the given constraints is

Class XII Maths www.vedantu.com 9


We can see that the feasible region is not bounded.
The points at the corners in the feasible region are A (6, 0), B (4, 1), and C (3, 2)
. Z assumes the following values on these points.

Since the feasible region is unbounded, we cannot be sure that 1 is the maximum
value of Z. To confirm this, we need to sketch the graph of the inequality,
x  2y  1 , and see if the resulting plane has any point in common with the
feasible region.
From the graph that we sketched, we can see that there are common points
between feasible regions and the sketched inequality. Thus, Z = 1 is not the
maximum value. Z has no maximum value.

10. Maximize Z  x  y , subject to x  y  1 ,  x  y  0 , x,y  0 .


Ans:

Class XII Maths www.vedantu.com 10


The given constraints are, x  y  1, x  y  0 , x, y  0 and the feasible region
which is in accordance with the given constraints is

We can see from the graph that there is no feasible region, hence Z has no
maximum value.

Class XII Maths www.vedantu.com 11

You might also like