Download App

Linear Programming — Maths STD 12 Science — Question

Gujarat BoardEnglish MediumSTD 12 ScienceMathsLinear Programming4 Marks
Question
Amit's mathematics teacher has given him three very long lists of problems with the instruction to submit not more than 100 of them (correctly solved) for credit. The problem in the first set are worth 5 points each, those in the second set are worth 4 points each, and those in the third set are worth 6 points each. Amit knows from experience that he requires on the average 3 minutes to solve a 5 point problem, 2 minutes to solve a 4 point problem, and 4 minutes to solve a 6 point problem. Because he has other subjects to worry about, he can not afford to devote more than $3\frac{1}{2}$ hours altogether to his mathematics assignment. Moreover, the first two sets of problems involve numerical calculations and he knows that he cannot stand more than $2\frac{1}{2}$ hours work on this type of problem. Under these circumstances, how many problems in each of these categories shall he do in order to get maximum possible credit for his efforts? Formulate this as a LPP.
✓

Answer

Given information can be tabulated as below:

Sets
Time requirement
points
I
3
5
II
2
 
III
4
6
Time for all three sets $=3\frac{1}{2}$ hours
Time for set I and II $=2\frac{1}{2}$ hours
Number of quations maximum 100

Given, each question from set I, II, III earn 5,4,6 points respectively, so x questions of set I, y questions of set II and z questions of set III earn 5x, 4y and 6z points, let total point credit be U

So, U = 5x + 4y + 6z

Given, each question of set I, II and III require 3,2 and 4 minutes respectively, so x questions of set I, y questions of set II and z questions of set III require 3x, 2y and 4z mimutes respectively but given that total time to devote in all three sets is

$3\frac{1}{2}$ hours = 210 minutes and first two sets is $2\frac{1}{2}$ hours = 150 minutes

So,

$3\text{x}+2\text{y}+4\text{z}\leq210$ (First constraint)

$3\text{x}+2\text{y}\leq150$ (Second constraint)

Given, total number of questions cannot exceed 100

So, $\text{x}+\text{y}+\text{z}\leq100$ (Third constraint)

Hence, mathematical formulation of LPP is

Find x and y which maximize U = 5x + 4y + 6z

Subject to constraint,

$3\text{x}+2\text{y}+4\text{z}\leq210$

$3\text{x}+2\text{y}\leq150$

$\text{x}+\text{y}+\text{z}\leq100$
$\text{x},\text{y},\text{z}\geq0$

[Since number of questions to solve from each set cannot be less than zero].

Need a full question paper?

Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.

Start Generating Free

Explore more

More "4 Marks" from Linear Programming→Linear Programming — all question types→Maths STD 12 Science question papers→Gujarat Board STD 12 Science question papers→Gujarat Board question paper generator→

Similar questions

If $\text{a}(1-\cos\theta),\text{y}=\text{a}(\theta+\sin\theta),$ prove that, $\frac{\text{d}^2\text{y}}{\text{dx}^2}=-\frac{1}{\text{a}}$ at $\theta=\frac{\pi}{2}.$
→
Given that $\frac{\text{dy}}{\text{dx}}=\text{e}^\text{-2y}$ and y = 0 when x = 5. Find the value of x when y = 3.
→
A wire of length 20m is to be cut into two pieces. One of the pieces will be bent into shape of a square and the other into shape of an equilateral triangle. Where the we should be cut so that the sum of the areas of the square and triangle is minimum ?
→
Without expanding, show that the values of the following determinant are zero:
$\begin{vmatrix}\frac{1}{\text{a}}&\text{a}^2&\text{bc}\\\frac{1}{\text{b}}&\text{b}^2&\text{ac}\\\frac{1}{\text{c}}&\text{c}^2&\text{ab} \end{vmatrix}$
→
A firm manufactures headache pills in two sizes A and B. Size A contains 2 grains of aspirin, 5 grains of bicarbonate and 1 grain of codeine; size B contains 1 grain of aspirin, 8 grains of bicarbonate and 66 grains of codeine. It has been found by users that it requires at least 12 grains of aspirin, 7.4 grains of bicarbonate and 24 grains of codeine for providing immediate effects. Determine graphically the least number of pills a patient should have to get immediate relief. Determine also the quantity of codeine consumed by patient
→
If function $f: R \rightarrow R , f(x)=x^2+2$ and $g: R \rightarrow R$ $g(x)=\frac{x}{x-1}, x \neq 1$ then find $f o g$ and $g o f$ and also find $( fog )(2)$ and $( gof )(-3)$ ?
→
Maximum Z = 30x + 20y

Subject to

$\text{x}+\text{y}\leq8$

$\text{x}+4\text{y}\geq12$

$5\text{x}+8\text{y}=20$

$\text{x},\text{y}\geq0$

→
Evaluate: $\int\frac{\text{x} + 2}{\sqrt{\text{x}^{2} + 5\text{x} + 6 }}\text{dx}.$
→
Five bad oranges are accidently mixed with 20 good ones. If four oranges are drawn one by one successfully with replacement, then find the probability distribution of number of bad oranges drawn. Hence find the mean and variance of the distribution.
→
Using differentials, find the approximate values of the following:
$25^{\frac{1}{3}}$
→