Scribd
Upload
13 views11 pages

Ma 12 Cbse I

The document contains important questions and solutions for Class 12 CBSE Mathematics on the topic of Linear Programming. It includes objective type questions, short answer questions, and detailed solutions to various linear programming problems. Key concepts such as objective function, feasible region, and methods to find minimum and maximum values are covered throughout the document.

Uploaded by

MR ROBN
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
13 views11 pages

Ma 12 Cbse I

The document contains important questions and solutions for Class 12 CBSE Mathematics on the topic of Linear Programming. It includes objective type questions, short answer questions, and detailed solutions to various linear programming problems. Key concepts such as objective function, feasible region, and methods to find minimum and maximum values are covered throughout the document.

Uploaded by

MR ROBN
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 11

CLASS 12 (CBSE BOARD) MATHEMATICS

CHAPTER12: LINEAR PROGRAMMING


IMPORTANT QUESTIONS-SOLUTIONS
NOTE : Section A: objective type questions 1 mark
Section B: Short answer type questions 3 marks
SECTION A
Question1. If it is not possible to choose the minimum or maximum from the value of the corner
points then the solution is
a) Bounded
b) unbounded
c) infesible
d) none of these
solution: unbounded
option b) is correct

Question2. In a linear program problem the objective function is always …………….


a) Interior Points in the common region
b) Corner points
c) All of the above
d) linear
solution: In a linear program problem the objective function is always linear
option d) is correct

Question3. Region represented by x ≥ 0, y ≥ 0 is:


a) first quadrant
b) second quadrant
c) third quadrant
d) origin
solution: Region represented by x ≥ 0, y ≥ 0 is first quadrant
option a) is correct

Question4. The objective function of a linear programming problem is:


a) constraint
b) function to be optimised
c) A relation between the variables
d) None of these
solution: function to be optimized
option b) is correct

Question5. Nobel prize was awarded to …….for work in linear programming


a) F.L. Hitchcock
b) L.Katorovich and T.C. Koopmans
c) G.B Dantzig
d) Pierre de Fermat
solution: Nobel prize was awarded to L.Katorovich and T.C. Koopmans for work in linear
programming
option b) is correct

Question 6: Fill in the blanks


1. The LPP solving is for………..
2. In feasible region points which are taken to solve LPP are called………
3. The function whose maximum value or minimum is to be found is called …………….
4. The common region determined by all the constraints including non negative constraints is
called………….
5. The constraints of a solution being feasible is ………….
Solution:
1. To decrease work load
2. Corner points
3. Objective function
4. Feasible region
5. x ≥0 ,y≥0

Question7: Give answer in one word/sentence


1. Define objective function
2. what are decision variables?
3. what are linear constraints?
4. define feasible region
5. define optimal value
Solution:
1) The function whose maximum or minimum value is to be found is called objective
function.
2) The variables that are specified by the decision maker are called the decision variables
3) Finding the maximum or minimum value of the objective function only under certain limits
or conditions, these are called linear restrictions or limits.
4) The region of the graphical representation to which the values of the variables are related
obeying all the conditions is called the feasible region .
5) The maximum or minimum values of the objective function is called optimal value.

SECTION B

Question1: minimize Z = x+2y -


2x+y ≥ 3, x+2y ≥ 6, x, y≥ 0
solution:
writing in equalities
2x + y =3 ….(i)
x + 2y =6 …(ii)
x = 0, y = 0 …(iii)

For 2x + y =3
X 0 3/2
Y 3 0
for testing points (0,0) 0+0≥3 =>0≥3 which is not true

half plane is away from the origin

For x + 2y = 6
X 0 6
Y 3 0
for testing points (0,0) 0+0≥6 => 0≥6 which is not true

= >half plane is away from the origin


Now solving(i) and (ii)
x=0,y=3
making graph we get feasible region XABY
now finding value of Z at corner points

corner points Z= x+2y


(6,0) 6minimum
(0,3) 6minimum
Minimum Value of z is 6 at (6,0) and (0,3)

Question 2: minimize and maximize Z = x + 2y under


x + 2y ≥ 100, 2x – y ≤ 0, 2x +y ≤ 200, x, y ≥ 0
solution:
writing in equalities
x + 2y = 100
2x – y = 0
2x + y = 200
x = 0 y=0
For x + 2y = 100
X 0 100
Y 50 0
for testing points (0,0) 0+0≥200 =>0≥200 which is not true

= ≥half plane is away from the origin

For 2x – y = 0
X 0 10
Y 0 20
for testing points (0,0) 0+0 0=>0 0 which is true

= ≥half plane is towards the origin


For 2x + y = 200
X 0 100
Y 200 0
for testing points (0,0) 0+0 200=>0 200 which is true

= ≥half plane is towards the origin

making graph we get feasible region BEDC


solving 2x + y = 200 and 2x – y = 0 we get x = 50, y = 100
⇒ D(50,100)
again solving x + 2y = 100 and 2x – y = 0 we get , x = 20, y = 40 ⇒E(20,40)

Now finding value of z at every corner points

At B(0,50) Z=0+2*50=100(minimum)
At E(20,40) Z=20+2*40=100(minimum)

At (50,100) Z=50+2*100=250

At (0,200)
Z=0+2*200=400(maximum)

Minimum value of Z at (0,50) and (20,40) is100 and maximum value at (0, 200) is 400
Question3. Maximize Z = 5x + 3y
3x + 5y ≤ 15, 5x + 2y ≤ 10, x ≥ 0, y ≥ 0
solution: Writing in equalities,
3x + 5y =15 ….(i)
5x + 2y=10 …(ii)
x = 0 …(iii)
y = 0 …(iv)
for 3x + 5y =15
X 0 5
Y 3 0
for testing points (0,0) 0+0≤15 =>0≤15 which is true

= ≥half plane is towards the origin


For

X 0 2
Y 5 0

for testing points (0,0) 0+0≤10 => 0≤10 which is true

= ≥half plane is towards the origin


Now making graph we get feasible region OABC

Solving (i) and (ii)


X=20/19 ,y=45/19

Now value of Z at every corner points

corner points

(0,0) 0
(2,0) 5*2+3*0=10
(0,3) 5*0+3*3=9
(20/19,45/19) 235/19
Maximum value of Z is 235/19

Question4: maximize Z = 3x + 4y
x + y ≤ 4, x ≥ 0, y ≥ 0
solution: Z = 3x +4y
x+y≤4
x ≥ 0, y ≥ 0
writing in equalities
x+y=4
x = 0 ….(ii) y = 0 …(iii)

For x + y = 4
X 0 4
Y 4 0
for testing points (0,0) 0+0≤4=>0≤4 which is true

= ≥half plane is towards the origin

Now making graph we get feasible region OAB


now value of Z value at every corner points
corner points

(0,0) 0
(4,0) 12
(0,4) 16 maximum
Maximum value of Z is16 at (0, 4)

Question5: maximize Z = x + y under


x – y ≤ – 1, – x + y ≤ 0, x, y ≥ 0
solution:
(i) region of x – y ≤ -1
line x – y = – 1 passes through A(-1,0), B(0, 1) which is AB
x – y ≤ – 1 we check at x =0, y = 0 ,
0 ≤ -1 which is not true
⇒half plane is away from the origin
(ii) region of – x + y ≤0
line – x + y = 0, passes through origin O(0,0)and C(1, 1)
– x + y ≤ 0 we check at x = 1, y = 0 , -1 ≤ 0 which is true
⇒half plane is towards the origin
we see that there is no proper feasible region
=>maximum value of z cannot be found.

Question6: if and then find maximum value of

Z=

solution: Z=

Given inequalities

Writing in equalities
…………………(i)

…………………(ii)

For

X 0 50
Y 50 0
For testing points (0,0) ,0+0≤50 or0≤50 which is true

= ≥half plane is towards the origin


For 3

X 0 30
Y 90 0
For testing points(0,0)
3 0+0 ≤ 90 => 0 ≤ 90 which is true

= ≥ half plane is towards the origin


Solving (i) and (ii)
x=20,y=30

now making graph we get feasible region OABC


now finding value of Z at corner points

At O(0,0) Z=4*0+0=0
At A(30,0)Z=4*30+0=120(maximum)
At B (20,30) Z=4*20+30=110
At C (0,50) Z=4*0+50=50
maximum value of Z=120at A(30,0)

Question7: minimize Z= x+2ywith constraints x-y , x+y

solution: Z =2x+y
Writing in equalities
x-y

x-y

for x-y=2

A B
X 2 4
Y 0 2
for testing points (0,0) 0+0≤2 =>0≤2 which is true

= ≥half plane is towards the origin

For x+y=4
C D
X 0 4
Y 4 0
for testing points (0,0) 0+0≤4 =>0≤4 which is true

= ≥half plane is towards the origin

now finding value of Z at corner points


Z=x+2y
At O(0,0) Z=0+2*0=0(minimum)
At A(2,0)Z=2+2*0=2
At ,E(3,1)Z=3+2*1=5
At C(0,4)Z=0+2*4=8
minimum value of Z is 0atO(0,0).

You might also like