Linear Programming  MCQs

MCQs of Linear Programming

Showing 21 to 30 out of 32 Questions
1 2 3 4
21.
The minimum value of z = 200x + 500y subject to conditions x + 2y ≥ 10, 3x + 4y ≤ 24 and x ≥ 0, y ≥ 0 is _____ .
(a) 2300
(b) 2500
(c) 3000
(d) 200
Answer:

Option (a)

22.
The minimum value of z = 3x + 2y subject to conditions x + y ≥ 8, 3x + 5y ≤ 15, x ≥ 0, y ≥ 0 _____ .
(a) is 15
(b) is 6
(c) is 16
(d) has no feasible region
Answer:

Option (d)

23.
One kind of cake requires 300 g of flour and 15 g of fat. Another kind of cake requires 150 g of flour and 30 g of fat. Assuming that there is no shortage of other ingredients used in making the cakes, the maximum number of cakes that can be prepared from 7.5 kg of flour and 600 g of fat is _____ .
(a) 20
(b) 25
(c) 30
(d) 40
Answer:

Option (c)

24.
Which of the following statement is correct ?
(a) Every linear programming problem has at least one optimal solution.
(b) Every linear programming problem has a unique optimal solution.
(c) If an linear programming problem has two optimal solutions, then it has infinitely many solutions.
(d) If a feasible region is unbounded, then linear programming problem has no solution.
Answer:

Option (c)

25.
In solving the linear programming problem : "Minimize z = 6x + 10y subject to x ≥ 6, y ≥ 2, 2x + y ≥ 10, x ≥ 0, y ≥ 0." Redundant constraints are _____ .
(a) x ≥ 6, y ≥ 2
(b) 2x + y ≥ 10, x ≥ 0, y ≥ 0
(c)  x ≥ 6
(d)  x ≥ 6, y ≥ 0
Answer:

Option (b)

26.
A feasible solution to a linear programming problem, _____ .
(a) must satisfy all of the problem's constraints simultaneously
(b) need not satisfy all of the constraints, only some of them
(c) must be a corner point of the feasible region
(d) must optimize the value of the objective function
Answer:

Option (a)

27.
The corner points of the feasible region determined by the system of linear constraints are (0, 15), (15, 15), (25, 25), (10, 35), (10, 0). Let z = px + qy, where p, q > 0. Condition on p and q so that the maximum of z occurs at both the points (25, 25) and (10, 35) is _____ .
(a) 3p = q
(b) p = 2q
(c) 2p = 3q
(d) 3p = 2q
Answer:

Option (d)

28.
For the linear programming problem : Minimize z = 4x + 5y, the co-ordinates of the corner points of the bounded feasible region are A (10, 10), B (20, 5), C (2, 17), D (16, 11) and E (17, 5). The minimum value of z is _____ .
(a) 80
(b) 90
(c) 93
(d) 105
Answer:

Option (b)

29.
Solution of the following linear programming problem : Maximize z = 5x + 6y subject to y ≤ 2x + 1, 5x + 2y ≤ 20 and x ≥ 0, y ≥ 0 _____ .
(a) is 6
(b) is 20
(c) is 40
(d) has no feasible region
Answer:

Option (c)

30.
The corner points of the feasible region determined by the system of linear constraints are (0, 10), (5, 5), (15, 15), (0, 20). Suppose z = px + 3y, where p > 0. If the maximum of z occurs at both the points (15, 15) and (0, 20), then p = _____ .
(a) 4
(b) 5
(c) 1
(d) 2
Answer:

Option (c)

Showing 21 to 30 out of 32 Questions
1 2 3 4