Question types

Linear programming question types

133 questions across 2 question groups — pick any mix to generate a MATHS paper with step-by-step answer keys.

133
Questions
2
Question groups
5
Question types
Sample Questions

Linear programming questions

One sample from each question group in this chapter. Select any group above to see the full set with answer keys.

Which of the following sets are convex?
  1. $\{(\text{x},\text{y}):\text{x}^2+\text{y}^2\geq1\}$
  2. $\{(\text{x},\text{y}):\text{y}^2\geq\text{x}\}$
  3. $\{(\text{x},\text{y}):3\text{x}^2+4\text{y}^2\geq5\}$
  4. $\{(\text{x},\text{y}):\text{y}\geq2,\text{y}\leq4\}$
View full solution
The corner points of the feasible region determined by the following system of linear inequalities:
2x + y ≤ 10, x + 3y ≤ 15, x, y ≥ 0 are (0, 0), (5, 0), (3, 4) and (0, 5).
Let Z = px + qy, where p.q > 0.
Condition on p and q so that the maximum of Z occurs at both (3, 4) and (0, 5) is:
  1. P = q
  2. p = 2q
  3. p = 3q
  4. q = 3q
View full solution
The objective function Z = 4x + 3y can be maximised subjected to the constraints 3x + 4y ≤ 24, 8x + 6y ≤ 48, x ≤ 5, y ≤ 6, x, y ≥ 0
  1. at only one point
  2. at two points only
  3. at an infinite number of points
  4. none of these
View full solution
The value of objective function is maximum under linear constraints
  1. at the centre of feasible region
  2. at (0, 0)
  3. at any vertex of feasible region
  4. the vertex which is maximum distance from (0, 0)
View full solution
The maximum value of Z = 4x + 3y subjected to the constraints 3x + 2y ≥ 160, 5x + 2y ≥ 200, x + 2y ≥ 80, x, y ≥ 0 is:
  1. 320
  2. 300
  3. 230
  4. none of these
View full solution
A factory uses three different resources for the manufacture of two different products, $20$ units of the resources $A, 12$ units of $B$ and $16$ units of $C$ being available. $1$ unit of the first product requires $2,2$ and $4$ units of the respective resources and $1$ unit of the second product requires $4, 2$ and $0$ units of respective resources. It is known that the first product gives a profit of $2$ monetary units per unit and the second $3.$ Formulate the linear programming problem. How many units of each product should be manufactured for maximizing the profit? Solve it graphically.
View full solution
To maintain one's health, a person must fulfil certain minimum daily requirements for the following three nutrients: calcium, protein and calories. The diet consists of only items I and II whose prices and nutrient contents are shown below:
  Food I Food II Minimum daily requirement
Calcium 10 4 20
Protein 5 6 20
Calories 2 6 12
Price Rs. 0.60 per unit Rs. 1.00 per unit  
Find the combination of food items so that the cost may be minimum.
View full solution
There are two types of fertilizers $F_{1 }$ and $F_2. F_{1 }$ consists of $10\%$ nitrogen and $6\%$ phosphoric acid and $​F_{2 }$ consists of $5\%$ nitrogen and $10\%$ phosphoric acid. After testing the soil conditions, a farmer finds the she needs atleast $14\ kg$ of nitrogen and $14\ kg$ of phosphoric acid for her crop. If $F_{1 }$ costs $Rs. 6/kg$ and $F_{2 }$ costs $Rs. 5/kg,$ determine how much of each type of fertilizer should be used so that the nutrient requirements are met at minimum cost. What is the minimum cost?
View full solution
A manufacturer produces two products A and B. Both the products are processed on two different machines. The available capacity of first machine is 12 hours and that of second machine is 9 hours per day. Each unit of product A requires 3 hours on both machines and each unit of product B requires 2 hours on first machine and 1 hour on second machine. Each unit of product A is sold at Rs. 7 profit and that of B at a profit of Rs. 4. Find the production level per day for maximum profit graphically.
View full solution
A manufacturer has three machine I, II, III installed in his factory. Machines I and II are capable of being operated for at most 12 hours whereas machine III must be operated for atleast 5 hours a day. She produces only two items M and N each requiring the use of all the three machines.
The number of hours required for producing 1 unit each of M and N on the three machines are given in the following table:
Item
Number of hours required on machines
 
I
II
III
M
1
2
1
N
2
1
1.25
She makes a profit of Rs. 600 and Rs. 400 on items M and N respectively. How many of each item should she produce so as to maximise her profit assuming that she can sell all the items that she produced? What will be the maximum profit?
View full solution

Generate a Linear programming paper free

Pick question groups from the list above, set marks and difficulty, and export a branded PDF with step-by-step answer keys. First 3 chapters free — no signup.

Download App