0% found this document useful (0 votes)
31 views5 pages

L.P.P 202

The document is a question bank for Linear Programming from the Bihar Board, covering the years 2009 to 2022. It contains various problems related to maximizing or minimizing objective functions subject to given constraints. Each question is labeled with the year it was included in the board exams.

Uploaded by

Raushan Raj
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
0% found this document useful (0 votes)
31 views5 pages

L.P.P 202

The document is a question bank for Linear Programming from the Bihar Board, covering the years 2009 to 2022. It contains various problems related to maximizing or minimizing objective functions subject to given constraints. Each question is labeled with the year it was included in the board exams.

Uploaded by

Raushan Raj
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/ 5

Bihar Board Question Bank

(2009 - 2022)

MATHEMATICS
Chapter 12
LINEAR PROGRAMMING

Join YouTube: Mastering Maths Classes


Mastering Maths Classes, Urdu Bazar Chock,
Bhagalpur, Bihar, 812002
MOB: 8210038850
Question Bank 2009 - 2022
(LINEAR PROGRAMMING)
LINAER PROGRAMMING

Q1. A company manufactures two types of dolls A and B. The combined production level
of both the dolls should not exceed 1200 dolls per week and the demand for the dolls
of type B is atmost half of that of dolls of type A. Further, the production level of
dolls of type A can exceed three times the production of dolls of type B by atmost 600
units. If the company makes a profit of Rs. 12 and Rs. 16 per dall respectively on A
and B, how many of each should be produced per week in order to maximum the
profit? [BSEB 2009, 7]
Q2. A manufacturer produce nuts and bolts. It takes 1 hour of work on machine A and 3
hours on machine B to produce a package of nuts. It take 3 hours on machine A and 1
hour on machine B to produce a package of bolts. He earns a profit of Rs. 17.50 per
package on nuts and Rs 7.00 per package on bolts. How many packages of each should
be produced each day so as to maximise his profit, if he operates his machines for at
the most 12 hours a day. [BSEB 2010, 7]
Q3. Solve the following LLP graphically :
Maximize Z  45 x  80 y
Subject to 5 x  20 y  400
10 x  15 y  450
and x  0, y  0. [BSEB 2011, 7]
Q4. Solve the following LLP graphically :
Maximize Z  5x  3 y
Subject to 3 x  5 y  15
5 x  2 y  10
x, y  0 [BSEB 2012, 7]
Q5. Solve the following LLP graphically :
Maximize Z  8x  7 y
Subject to 3 x  y  66 ; x  y  45 ; x  20; y  40; x, y  0 . [BSEB 2013, 7]
Q6. Solve the following LLP graphically :
Minimize Z  5x  7 y
Subject to x y 4
3 x  8 y  24
10 x  7 y  35
x, y  0. [BSEB 2014, 5]
Q7. Minimize Z  3 x  3 y
Subject to x  2y  8
3 x  2 y  12
x  0, y  0. [BSEB 2015, 7]
Q8. Minimize : Z  x  2y
Subject to 2x  y  3
x  2y  6
x, y  0 . [BSEB 2016, 7]

Mastering Maths Classes, Bhagalpur 8210038850 P. No. 2


Question Bank 2009 - 2022
(LINEAR PROGRAMMING)

Q9. Maximize Z  y  2x
Subject to x2
x y 3
2 x  y  1
x, y  0 . [BSEB 2017, 7]
Q10. Maximize Z  7x  3y
Subject to x  2y  3
x y 4
x  0, y  0 [BSEB 2018, 5]
Q11. A Furniture dealer deals in only two items, table and chair . He has Rs. 5000 to invest
and a space to store at most 60 pieces. A table costs him Rs. 250 and a chair Rs. 50. He
can sell a table at a profit of Rs. 50 and chair at a profit RS. 15 . Assuming that he can
sell the items that he buys, how should he invest his money in order that he may
maximize his profit. [BSEB 2018, 5]
Q12. Maximize Z  3 x  3 y
Subject to x  2y  8
3 x  2 y  12
x  0, y  0 [BSEB 2019, 5]
Q13. The minimum value of Z  3 x  5 y

subject to constraints x  3 y  3
x y2
x, y  0 is
(A) 0 (B) 9
(C) 7 (D) 10 [BSEB 2020, 1]
Q14. The maximum value of Z  3 x  2 y

subject to constraints x  2 y  10
3x  y  2
x  0, y  0 is
(A) 0 (B) 9
(C) 7 (D) 10 [BSEB 2020, 1]
Q15. Solve the following linear programming problem:
Maximize Z  3x  4 y
Subject to constraints x  y  4
x  0, y  0 [BSEB 2020, 2]
Q16. Solve the following linear programming problem graphically :
Maximize Z  4x  y
Subject to the constraints x  y  50
3 x  y  90
x  0, y  0 . [BSEB 2020, 5]
Mastering Maths Classes, Bhagalpur 8210038850 P. No. 3
Question Bank 2009 - 2022
(LINEAR PROGRAMMING)

Q17. The maximum value of Z  3 x  4 y


subject to constraints x  y  4 .
x  0, y  0 is
(A) 0 (B) 12
(C) 16 (D) none of these [BSEB 2021, 1]
Q18. Maximise and minimise Z  5 x  10 y
subject to x  2 y  120
x  y  60
x  2y  0
x, y  0 [BSEB 2021, 5]
Q19. The minimum value of Z  2 x  3 y subject to the constraints x  y  5, x  0, y  0 is
(A) 0 (B) 10
(C) 15 (D) 20 [BSEB 2022, 1]
Q20. Which of the following is an objective function?
(A) Z  5x  7 y (B) x0
(C) y0 (D) none of these [BSEB 2022, 1]
Q21. The minimum value of 11x  2 y subject to the constraints x  y  7, x  0, y  0 is
(A) 77 (B) 14
(C) 0 (D) 14 [BSEB 2022, 1]
Q22. The maximum value x  y of subject to the constraints 3 x  5 y  30, x  0, y  0 is
(A) 16 (B) 10
(C) 6 (D) none of these [BSEB 2022, 1]
Q23. Solve the following linear programming problem:
Maximize Z  2x  3 y
subject to constraints 3 x  4 y  12, x  0, y  0 . [BSEB 2022, 2]
Q24. Minimise Z  2x  y
subject to x  y 1
x  2 y  10
y4
x  0, y  0 . [BSEB 2022, 2]
Q25. The maximum value of z  6 x  3 y subject to constraints is x  y  25, x  0, y  0
(A) 150 (B) 225
(C) 425 (D) none of these [BSEB 2023]
Q26. The maximum value of z  x  3 y subject to constraints x  y  13 , x  0 , y  0 is

(A)39 (B) 26
(C) 13 (D) -26 [BSEB 2023]

Mastering Maths Classes, Bhagalpur 8210038850 P. No. 4


Question Bank 2009 - 2022
(LINEAR PROGRAMMING)

Q27. The maximum value of z  7 x  8 y subject to constraints x  y  24, x  0 , y  0 is

(A) 56 (B) 48
(C) 0 (D) -12
Q28. maximize z  3 x  7 y [BSEB 2023, 2]
subject to the constraints x  2 y  16
x  0, y  0 .
Q29. maximize z  5 x  7 y [BSEB 2023, 5]
Subject to x  y  4
3 x  8 y  24
10 x  7 y  35
x, y  0

Mastering Maths Classes, Bhagalpur 8210038850 P. No. 5

You might also like