LPP Test-2

1) Two types of Lorries X and Y have been used to transport 70 tons solid and 30 tons liquid
substance. X type lorry can carry 5 tons solid and 2 tons liquid. Y type lorry can carry 4 tons
solid and 3 tons liquid. The cost of transport are Rs. 450 and Rs. 480 per lorry t of X and Y
respectively. The mathematical formulation of the problem as a LPP is
(a) Maximize z = 450x1 + 480x2
subject to, 5x1 + 4x2 ≤ 70
2x1 + 3x2 ≤ 30
x1 ≥ 0, x2 ≥ 0
(b) Miniimize z = 450x1 + 480x2
subject to, 5x1 + 4x2 ≤ 70
2x1 + 3x2 ≤ 30
x1 ≥ 0, x2 ≥ 0

(c) Minimize z = 450x1 + 480x2

subject to, 5x1 + 4x2 ≥ 70
2x1 + 3x2 ≥ 30
x1 ≥ 0, x2 ≥ 0

(d) Maximize z = 450x1 + 480x2

subject to, 5x1 + 4x2 ≥ 70
2x1 + 3x2 ≥ 70
x1 ≥ 0, x2 ≥ 0
2) Consider a set of m linear simultaneous equations with n unknowns (n>m), Ax=b. Then
the number of non-zero variable in a degenerate basic solutions will be
a) at least m-1
b) at most n-m
c) exactly m
d) at most m-1
3) The number of basic solutions of the following linear equations
4𝑥1 + 2𝑥2 + 3𝑥3 − 8𝑥4 = 6
3𝑥1 + 5𝑥2 + 4𝑥3 − 6𝑥4 = 8
are
a) 2
b) 3
c) 4
d) None of these.
4) The set {(𝑥, 𝑦) ∈ ℝ2 : 𝑦 = 𝑚𝑥 + 𝑐; 𝑚, 𝑐 ∈ ℝ} is
a) a convex set
b) not a convex set
c) a convex set with finite number of extreme points.
d) a convex set with infinite number of extreme points.
5) Which of the following sets is not convex?
a) 𝑋 = {(𝑥, 𝑦): 𝑥 2 + 𝑦 2 ≥ 5}
b) 𝑋 = {(𝑥, 𝑦): ⃓𝑥⃓ ≤ 3, ⃓𝑦⃓ ≤ 2}
c) 𝑋 = {(𝑥, 𝑦): 5𝑥 − 𝑦 = 4}
d) 𝑋 = {(𝑥, 𝑦): 2𝑥 − 𝑦 ≤ 3}
6) Which of the following statement is correct?
a) An extreme point is a boundary point.
b) A boundary point is an extreme point.
c) An interior point may be an extreme point.
d) An exterior point may be extreme point.
7) According to simplex algorithm, the slack variables are assigned zero coefficients because
slack variables
a) are not present in the final simplex table
b) have no contribution in the objective function
c) have no contribution in the subjective function
d) have contribution in the objective function
8) A plane 2x+y+3z=5 is a convex set with
a) no extreme point
b) at most one extreme point
c) finite number of extreme points
d) infinite number of extreme points
9) In a LPP, the conditions to be satisfied are
a) objective functions have to be linear
b) constraints have to be linear
c) decision variables are non-negative
d) all of the above
 10) The optimal solution of the LPP is
𝑀𝑖𝑛 𝑧 = 5𝑥1 + 9𝑥2
𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜, 2𝑥1 + 𝑥2 ≤ 4
3𝑥1 + 2𝑥2 ≥ 70
𝑥1 ≥ 0, 𝑥2 ≥ 0 is
a) (2,0)
b) (0,4)
c) (0,3)
d) Does not exist
11) If there be a feasible solution to a set of m linear simultaneous equations with n
unknowns
(n > m) 𝐴𝑥 = 𝑏, 𝑥 ≥ 0 and if R(A)=m, then the solution is
a) a basic feasible solution
b) a basic but not feasible solution
c) a feasible but not basic solution
d) neither basic nor feasible solution
12) If any iteration of the simplex algorithm, 𝑧𝑗 − 𝑐𝑗 > 0 for at least one j and for this j, 𝑦𝑖𝑗 ≤
0 for all 𝑖 = 1,2, … . . , 𝑚 then the L.P.P admits of
a) an unbounded solution in a maximization problem
b) an unbounded solution in a minimization problem
c) no feasible solution
d) alternative solutions
13) The number of basic variables in any solution of a transportation problem with m origins
and n destinations is
a) m+n
b) minimum (m+n)
c) at most (m+n+1)
d) at most (m+n-1)
14) Consider the following transportation problem: The solution by North-West corner
𝐷1 𝐷2 𝐷3 𝑎𝑖
𝑂1 5 3 2 10
𝑂2 7 4 2 20
𝑂3 2 3 6 15
𝑏𝑗 15 15 15
rule is
a) non-degenerate basic feasible solution
b) degenerate basic feasible solution
 c) degenerate non-basic feasible solution
d) non-degenerate non-basic feasible solution
15) To convert a maximizing transportation problem into a minimizing problem, which of the
following technique is used?
a) All entries are multiplied by -1
b) Subtracting all entries from the highest entry
c) Both (a) & (b)
d) None of the above
16) The minimum cost of the assignment problem is
A B C D
I 10 25 15 20
II 15 30 5 15
III 35 20 12 24
IV 17 25 24 20
Is
a) 55
b) 49
c) 59
d) 51
17) In an n-person and n-job assignment problem, the number of non-basic variables will be
a) (𝑛 − 1)2
b) (𝑛 − 1)
c) (2𝑛 − 1)
d) (𝑛)2
18) The dual of the primal L.P.P
𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑧 = 𝑥1 + 2𝑥2
𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜, 3𝑥1 − 𝑥2 ≥ 2
𝑥1 − 𝑥2 ≤ 1
𝑥1 ≥ 0, 𝑥2 ≥ 0
Is
a) 𝑀𝑖𝑛 𝑤 = 2𝑤1 + 𝑤2
𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜 − 3𝑤1 + 𝑤2 ≥ 1
𝑤1 − 𝑤2 ≥ 2
𝑤1 , 𝑤2 ≥ 0
b) 𝑀𝑖𝑛 𝑤 = −2𝑤1 + 𝑤2
𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜 − 3𝑤1 + 𝑤2 ≤ 1
𝑤1 − 𝑤2 ≥ 2
𝑤1 , 𝑤2 ≥ 0
 c) 𝑀𝑖𝑛 𝑤 = −2𝑤1 + 𝑤2
𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜 − 3𝑤1 + 𝑤2 ≤ 1
𝑤1 − 𝑤2 ≤ 2
𝑤1 , 𝑤2 ≥ 0
d) 𝑀𝑖𝑛 𝑤 = −2𝑤1 + 𝑤2
𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜 − 3𝑤1 + 𝑤2 ≥ 1
𝑤1 − 𝑤2 ≥ 2
𝑤1 , 𝑤2 ≥ 0
19) When total supply and demand are equal in transportation problem, then the problem is
said to be
a) unbalanced
b) balanced
c) degenerate
d) non-degenerate
20) A hyperplane is aconvex set with
a) finite number of extreme points
b) infinite number of extreme points
c) no extreme points
d) only one extreme point
 ANSWER KEY

Question Number Answer Key

1. c
2. d
3. d
4. a
5. a
6. a
7. b
8. a
9. d
10. d
11. a
12. b
13. d
14. b
15. c
16. a
17. a
18. d
19. b
20. c