Scribd
Upload
31 views2 pages

Question 1941606

This document is a practice set for Class 12 Mathematics focusing on linear programming problems. It includes multiple-choice questions and graphical problems aimed at maximizing and minimizing objective functions under given constraints. The total time allowed for the practice set is 1 hour and 30 minutes, with a maximum score of 30 marks.

Uploaded by

padhisp1
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
31 views2 pages

Question 1941606

This document is a practice set for Class 12 Mathematics focusing on linear programming problems. It includes multiple-choice questions and graphical problems aimed at maximizing and minimizing objective functions under given constraints. The total time allowed for the practice set is 1 hour and 30 minutes, with a maximum score of 30 marks.

Uploaded by

padhisp1
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/ 2

PARIKSIT INCORPORATIONS

INFRONT OF B/18 ,KOELNAGAR

PRACTICE SET
Class 12 - Mathematics
Time Allowed: 1 hour and 30 minutes Maximum Marks: 30

Section A
1. The common region determined by all the constraints of a linear programming problem is called: [1]

a) an optimal region b) a feasible region

c) a bounded region d) an unbounded region


2. The corner points of the feasible region determined by the system of linear constraints are (0, 10), (5, 5), (15, [1]
15), (0, 20). Let Z = px + qy, where p, q > 0. Condition on p and q so that the maximum of Z occurs at both the
points (15, 15) and (0, 20) is

a) q = 3p b) q = 2p

c) p = q d) p = 2q
3. The value of objective function Z = 2x + 3y at comer point (3, 2) is [1]

a) 9 b) 5

c) 15 d) 12
4. A feasible region of a system of linear inequalities is said to be ..., if it can be enclosed within a circle. [1]

a) unbounded b) In squared form

c) bounded d) in circled form


5. Determine the maximum value of Z = 11x + 7y subject to the constraints :2x + y ≤ 6, x ≤ 2, x ≥ 0, y ≥ 0. [1]

a) 47 b) 43

c) 42 d) 45
6. A linear programming problem deals with the optimization of a/an: [1]

a) logarithmic function b) exponential function

c) linear function d) quadratic function


Section B
7. Solve the Linear Programming Problem graphically: [3]
Maximize Z = - x1 + 2x2 Subject to
-x1 + 3x2 ≤ 10
x1 + x2 ≤ 6

x1 - x2 ≤ 2
x1, x2 ≥ 0
8. Solve the Linear Programming Problem graphically: [3]

1/2
Maximize Z = 4x + 3y Subject to
3x + 4y ≤ 24
8x + 6y ≤ 48
x≤5
y≤6
x, y ≥ 0
9. Maximise and Minimise Z = 3x– 4y. subject to [3]
x − 2y ≤ 0

−3x + y ≤ 4

x− y ≤ 6

x, y ≥ 0

10. Maximize Z = 5x + 3y subject to 3x + 5y ⩽ 15, 5x + 2y ⩽ 10, x ⩾ 0, y ⩾ 0. [5]


11. Solve the Linear Programming Problem graphically: [5]
Minimise Z = x + 2y subject to 2x + y ≥ 3, x + 2y ≥ 6, x, y ≥ 0.
12. Show that the minimum of Z occurs at more than two points. [5]
Minimize and Maximize Z = 5x + 10y subject to x + 2y ≤ 120, x + y ≥ 60 , x − 2y ≥ 0, x, y ≥ 0 .

2/2

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