Linear Programming Test
Linear Programming
This is Linear Programming Test-05 for CBSE class 12 Maths.. There are 15 questions in this test with each question having around four answer choices.
Questions & Answers
1
Corner points of the feasible region for an LPP are (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5).Let F = 4x + 6y be the objective function. Maximum of F – Minimum of F =
- A48
- B42
- C60Correct
- D18
2
Corner points of the feasible region determined by the system of linear constraints are (0, 3), (1, 1) and (3, 0). Let Z = px+qy, where p, q > 0. Condition on p and q so that the minimum of Z occurs at (3, 0) and (1, 1) is
- Ap = q
- Bp = 3q
- Cp = 2q
- D\(p = \frac{q}{2}\)Correct
3
In a LPP, the linear inequalities or restrictions on the variables are called
- ALinear constraintsCorrect
- BLimits
- CConstraints
- DInequalities
4
Determine the maximum value of Z = 3x + 4y if the feasible region (shaded) for a LPP is shown in Figure above.

- A206
- B196Correct
- C226
- D216
5
Feasible region (shaded) for a LPP is shown in Figure. Maximize Z = 5x + 7y.

- A47
- B43Correct
- C45
- D49
6
The feasible region for a LPP is shown in Figure. Find the minimum value of Z = 11x + 7y.

- A22
- B19
- C20
- D21Correct
7
The feasible region for a LPP is shown in Figure. Find the maximum value of Z = 11x + 7y.

- A49
- B50
- C47Correct
- D48
8
The feasible region for a LPP is shown in Figure. Evaluate Z = 4x + y at each of the corner points of this region. Find the minimum value of Z, if it exists

- AMinimum value = 5
- BMinimum value = 4
- CMinimum value = 3
- DMinimum value = 2Correct
9
In Figure, the feasible region (shaded) for a LPP is shown. Determine the maximum and minimum value of Z = x + 2y

- AMaximum = 10, minimum = 3\(\frac{1}{4}\)
- BMaximum = 8, minimum = 3\(\frac{1}{6}\)
- CMaximum = 9, minimum = 3\(\frac{1}{7}\)Correct
- DMaximum = 7, minimum = 3\(\frac{1}{9}\)
10
Determine the minimum value of Z = 3x + 4y if the feasible region (shaded) for a LPP is shown in Figure above.

- A154
- B132Correct
- C196
- D112
11
The feasible solution for a LPP is shown in Figure. Let Z = 3x – 4y be the objective function. Minimum of Z occurs at

- A(5, 0)
- B(0, 0)
- C(0, 8)Correct
- D(4, 10)
12
The feasible solution for a LPP is shown in Figure. Let Z = 3x – 4y be the objective function. Maximum value of Z occurs at

- A(6, 8)
- B(4, 10)
- C(6, 5)
- D(5, 0)Correct
13
The feasible solution for a LPP is shown in Figure. Let Z = 3x – 4y be the objective function. (Maximum value of Z + Minimum value of Z) is equal to

- A– 13
- B13
- C– 17Correct
- D1
14
The feasible region for an LPP is shown in the Figure. Let F = 3x – 4y be the objective function. Maximum value of F is.

- A8
- B– 18
- C12Correct
- D0
15
The feasible region for an LPP is shown in the Figure. Let F = 3x – 4y be the objective function.Minimum value of F is.

- A12
- B0
- C– 16
- Ddoes not existCorrect