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].
Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.