Scribd
Upload
14 views2 pages

Class - 12 Time: 1.5Hr Test: LPP MM: 30 1 Marks Questions

The document contains a test paper for Class 12 students focusing on Linear Programming Problems (LPP) with various questions to maximize or minimize objective functions under given constraints. It includes multiple-choice questions, as well as graphical problems requiring students to determine feasible regions and optimal values. The test is structured with questions worth 1, 3, and 5 marks, totaling 30 marks and lasting 1.5 hours.

Uploaded by

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

Class - 12 Time: 1.5Hr Test: LPP MM: 30 1 Marks Questions

The document contains a test paper for Class 12 students focusing on Linear Programming Problems (LPP) with various questions to maximize or minimize objective functions under given constraints. It includes multiple-choice questions, as well as graphical problems requiring students to determine feasible regions and optimal values. The test is structured with questions worth 1, 3, and 5 marks, totaling 30 marks and lasting 1.5 hours.

Uploaded by

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

A PLUS ACADEMY

a grade above…….
(a) 2x + y ≤ 52 and x + 2y ≤ 76
th
CLASS – 12
(b) 2x + y ≤ 104 and x + 2y ≤ 76
Time : 1.5hr Test : LPP MM: 30
1 Marks questions (c) x + 2y ≤ 104 and 2x + y ≤ 76

Q1. The objective function Z = 4 x+3 y can be (d) x + 2y ≤ 104 and 2x + y ≤ 38


maximized subjected to the constraints Q5. The feasible region for an LPP is shown
3 x+ 4 y ≤ 24 below:
8 x +6 y ≤ 4 8, x ≤ 5 , y ≤ 6 ; x , y ≥ 0

(a) at only one point


(b) at only two points
(c) at an infinite number of points
(d) None of these
Let z=3 x−4 y be the objective function.
Q2. The number of solutions of the system of
Minimum of z occurs at
inequations x + 2y ≤ 3, 3x + 4y ≥ 12, x ≥ 0, y ≥ 1 is:
(a) (0,0) (b) (0,8) (c) (5,0) (d) (4,10)
(a) 0 (b) 2
Q6. The optimal value of the objective function
(c) finite (d) infinite
is attained at the points given by
Q3. If the minimum value of an objective
(a) intersection of inequations with y-axis only
function
(b) intersection of inequations with x-axis only
Z = ax + by occurs at two points (3, 4) and (4, 3),
then: (c) Corner points of feasible region
(a) a + b = 0 (b) a = b (d) none of these
(c) 3a = b (d) a = 3b Q7. The point which does not lie in the half
plane 2 x+3 y −12≤ 0 is
Q4. The feasible region of an LPP is given in the
following figure: (a) (1, 2) (b) (2, 1) (c) (2,3) (d) (-
3, 2)
Q8. A linear programming problem is as follows:
Minimize : Z=2 x + y
Subject to constraints: x ≥ 3 , x ≤ 9 , y ≥ 0
x− y ≥ 0 , x + y ≤14.

The feasible region has


(a) 5 corner points including (0, 0) and (9, 5)
Then, the constraints of the LPP are x ≥ 0, y ≥ 0 (b) 5 corner points including (7, 7) and (3, 3)
and (c) 5 corner points including (14, 0) and (9, 0)

27/824, 1st Floor, DDA Flats, Madangir Phone: 9205514655


A PLUS ACADEMY
a grade above…….
(d) 5 corner points including (3, 6) and (9, 5) −3 x+ 2 y ≤ 3 , x , y ≥ 0

3 marks questions
Q9. Find the maximum value of Z = x +3 y ,
subject to constraints
2 x+ y ≤ 20 , x +2 y ≤20 , x , y ≥ 0.

Q10. Determine the maximum value of Z


¿ 3 x+ 4 y of the feasible region for the LPP as
shown in fig.

Q11. Minimize : Z¿ 10 x+ 4 y
Subject to constraints: 4 x+ y ≥ 80 , 2 x + y ≥ 60
x , y ≥0
Q12. Maximize : Z¿ 1000 x+ 500 y
Subject to constraints:
3 x+ 5 y ≤ 225 , 2 x + y ≤80 ,
x , y ≥0
5 marks questions
Q13. Solve the following LPP graphically:
Minimize: Z¿ 5 x+ 7 y
Subject to constraints: 2 x+ y ≥ 8
x +2 y ≥ 10 , x , y ≥ 0

Q14. Maximize and minimize Z=5 x+2 y


Subject to the following constraints:
x−2 y ≤2 , 3 x+2 y ≤12 ,

27/824, 1st Floor, DDA Flats, Madangir Phone: 9205514655

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy