Scribd
Upload
6 views1 page

12 Linear Programming

The document outlines a Class XII Mathematics examination focused on Linear Programming, consisting of five questions with varying marks. Questions include solving linear programming problems using graphical methods, determining corner points of feasible regions, and finding minimum and maximum values of objective functions. The exam is structured to assess students' understanding of linear constraints and optimization techniques within a 60-minute timeframe.

Uploaded by

jaipritiksh7thb
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
6 views1 page

12 Linear Programming

The document outlines a Class XII Mathematics examination focused on Linear Programming, consisting of five questions with varying marks. Questions include solving linear programming problems using graphical methods, determining corner points of feasible regions, and finding minimum and maximum values of objective functions. The exam is structured to assess students' understanding of linear constraints and optimization techniques within a 60-minute timeframe.

Uploaded by

jaipritiksh7thb
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

Class XII - Mathematics (041) Max.

Marks - 20
Topics - Linear Programming Time - 60 Minutes
Followings are of 3 Marks each (Q01 & 02).
Q01. Solve the following Linear Programming Problem using graphical method :
Maximize Z  3x  4y , Subject to x  y  4, x  0 and y  0 .
Q02. A linear programming problem is as follows :
Minimize z  2x  y
Subject to the constraints x  3, x  9, y  0, x  y  0, x  y  14 .
Then determine the total number of corner points of the feasible region. [3  2  6

Following is of 4 Marks (Q03).


3 
Q03. PASSAGE BASED QUESTION : The corner points A  , 0  , B(0, 1), C(0, 2), D(3, 4) and E(7, 0)
2 
of the feasible region determined by a system of linear constraints are as shown below.

Answer each of the following :


(i) If Z  4x  5y represents the objective function, then find the minimum value of Z.
(ii) Write the point at which the minimum value of Z is obtained.
(iii) Find the point at which the maximum value of Z is obtained.
Z m
(iv) Let C  . Then find a linear relation in m and n.
ZE n
[2  2  4
Followings are of 5 Marks each (Q04-05).

Q04. Solve the following linear programming problem (L.P.P.) graphically.


Maximize Z  x  2y .
Subject to constraints x  2y  100, 2x – y  0, 2x  y  200 ; x, y  0.

Q05. For a linear programming, the corner points of the feasible region of LPP are given by the points
(0, 2), (3, 0), (6, 0), (6, 8) and (0, 5).
Keeping the above information in mind, answer the followings :
(i) Let F  4x  6y be the objective function. Then find the point (s) at which the Minimum and
Maximum value of F occurs. What is the difference between Maximum and Minimum values
of F? Also, write the x and y coordinates of the corner point, where maximum value of F
occurs.
(ii) Let S  m x  n y, where m, n  0 be the objective function. Find the condition on m and n so
that the value of S at (6, 0) is twice the value of S at (0, 5). [5  2  10

You might also like