MCQ

1. In an LPP the decision variable can take

(a) Any real values (b) Integer values only
(c) Any non-negative real values (d) Non-negative integer values
2. The number of basic solutions to the system
6𝑥1 − 2𝑥2 + 5𝑥3 − 3𝑥4 = 20
6𝑥1 − 4𝑥2 + 10𝑥3 − 𝑥4 = 30
is
(a) 6 (b) 4
(c) 3 (d) 2
3. The maximum number of basic solutions in a system of 𝑚 equations in 𝑛 unknowns (𝑛 > 𝑚) will be
(a) 𝑚 + 𝑛 (b) 𝑛 − 𝑚
(c) 𝑚𝑛 (d) 𝑛𝐶 𝑚
4. Given the LPP, 𝑀𝑎𝑥 𝑍 = 2𝑥1 + 3𝑥2
Subject to 3𝑥1 + 𝑥2 ≤ 3
𝑥1 , 𝑥2 ≥ 0
The optimal value of the objective function will be
(a) 2 (b) 9
(c) 3 (d) 1
5. The minimum number zeros in a basic solution of a system of 𝑚 with 𝑛 unknowns (𝑛 > 𝑚) will be
(a) 𝑚 (b) 𝑛
(c) 𝑛𝐶 𝑚 (d) 𝑛 − 𝑚
6. Which of the following is a non-degenerate basic feasible solution in a system of two equations with four
unknowns?
(a) (0 2 3 0)
(b) (1 −2 3 0)
(c) (1 0 0 0)
(d) (10 0 −3 0)
7. The LPP
𝑀𝑎𝑥 𝑍 = 3𝑥1 + 2𝑥2
Subject to 2𝑥1 + 𝑥2 ≤ 2
3𝑥1 + 4𝑥2 ≥ 12
𝑥1 , 𝑥2 ≥ 0 has
(a) no feasible solution (b) unique feasible solution
(c) infinite number of feasible solution (d) none of these
8. The value of the objective function at an optimal solution of the LPP
𝑀𝑎𝑥 𝑍 = 10𝑥1 + 15𝑥2
Subject to 𝑥1 + 𝑥2 ≥ 2
3𝑥1 + 2𝑥2 ≤ 6
𝑥1 , 𝑥2 ≥ 0 will be
(a) 30 (b) 45
(c) 20 (d) 25
9. Any solution to a general LPP which satisfies the non-negative restrictions of the problem is called a
(a) basic solution (b) optimal solution
(c) feasible solution (d) non-degenerate solution
10. Given the LPP
 𝑀𝑖𝑛 𝑍 = 3𝑥1 + 5𝑥2
Subject to 2𝑥1 + 𝑥2 ≥ 3
𝑥1 + 3𝑥2 ≥ 4
𝑥1 , 𝑥2 ≥ 0;
The optimal value of the objective function
(a) 4 (b)8
(c) 12 (d) 15
11. Consider the following L.P.P
Max 𝑧 = 6𝑥 − 4𝑦
Subject to 2𝑥 + 4𝑦 ≤ 4
4𝑥 + 8𝑦 ≥ 16
𝑥, 𝑦 ≥ 0
This L.P.P has
(a) infeasible solution (b) unbounded solution
(c) basic feasible solution (d) feasible solution

12.The feasible solution of a L.P.P belongs to

(a) first and second quadrant (b) first and third quadrant
(c) only first quadrant (d) only second quadrant

13.The constraints −𝑥 + 𝑦 ≤ 1, −𝑥 + 3𝑦 ≤ 9 and 𝑥, 𝑦 ≥ 0 defined on

(a) bounded feasible space (b) unbounded feasible space
(c) both bounded and unbounded feasible space (d) none of these

14. While solving a LPP what is the maximum number of basic solutions that can be obtained from 𝑛
variables and 𝑚 equation where 𝑛 > 𝑚
𝑛! 𝑚!
(a) 𝑚!(𝑛−𝑚)! (b) 𝑛!(𝑛−𝑚)!
𝑛! 𝑚!
(𝑐) 𝑚!(𝑛+𝑚)! (d) 𝑛!(𝑛+𝑚)!

15. What happens when maximin and minimax values of the game are same?
(a) no solution exists (b) solution is mixed
(c) saddle point exists
(d) none of these
16. The method used to solve an LPP without the use of artificial variable is called
(a) Penalty method (b) Two-phase method
(c) Big M-method (d) Dual simplex method
17. Consider a set of 𝑚 linear simultaneous equations with 𝑛 unkowns (𝑛 > 𝑚), 𝐴𝑥 = 𝑏. Then the minimum
number of zeros in a basic solution will be
(a) 𝑛
(b) 𝑛 − 𝑚
(c) 𝑚
𝑛
(d) ( )
𝑚
18. Which of the following is non-degenerate basic feasible solution in a system of 2 equations with 4
unknowns?
(a) (0,2,3,0) (b) (1, −2,0,0)
(c) (1,0,0,0) (d) (10,0, −5,0)
19. The dual of the primal LPP
Max 𝑧 = 𝑐𝑥
 Subject to 𝐴𝑥 ≤ 4
𝑥≥0
with usual meaning is
(a)Max 𝑤 = 𝑐 𝑇 𝑤
Subject to 𝐴𝑇 𝑤 ≥ 𝑏𝑇
𝑤≥0
(b) Min 𝑤 = 𝑏𝑇 𝑤
Subject to 𝐴𝑇 𝑤 ≥ 𝑐 𝑇
𝑤≤0
(c) Min 𝑤 = −𝑏𝑇 𝑤
Subject to 𝐴𝑇 𝑤 ≥ 𝑐 𝑇
𝑤≥0
(d) Min 𝑤 = 𝑏𝑇 𝑤
Subject to 𝐴𝑇 𝑤 ≥ 𝑐 𝑇
𝑤≥0
20. The dual of the primal LPP
Min 𝑧 = 3𝑥1 − 2𝑥2
Subject to 2𝑥1 + 𝑥2 ≤ 1
−𝑥1 + 3𝑥2 ≥ 4
𝑥1 , 𝑥2 ≥ 0 is
(a)Max 𝑤 = −𝑤1 + 4𝑤2
Subject to −2𝑤1 − 𝑤2 ≤ 3
𝑤1 + 3𝑤2 ≤ −2
𝑤1 , 𝑤2 ≥ 0
(b) Max𝑤 = −𝑤1 − 4𝑤2
Subject to −2𝑤1 − 𝑤2 ≤ 3
−𝑤1 + 3𝑤2 ≤ −2
𝑤1 , 𝑤2 ≥ 0
(c) Max 𝑤 = −𝑤1 + 4𝑤2
Subject to −2𝑤1 − 𝑤2 ≤ 3
−𝑤1 + 3𝑤2 ≤ −2
𝑤1 , 𝑤2 ≥ 0
(d) Max 𝑤 = −𝑤1 + 4𝑤2
Subject to −2𝑤1 − 𝑤2 ≤ 3
𝑤1 + 3𝑤2 ≥ −2
𝑤1 , 𝑤2 ≥ 0
21. In a LPP the number of basic feasible solution is
(a) finite (b) infinite
(c) only one (d) countable
22. In a simplex method, the starting solution of an LPP must be
(a) optimal solution (b) optimal but non-feasible
(c) basic but non-feasible (d) non-optimal and feasible
23. The primal of an LPP has an unbounded objective function, then the dual has
(a) optimal solution (b) no feasible solution
(c)feasible solution (d) unbounded solution
24. For the LPP Min 𝑧 = 7𝑥1 + 8𝑥2 + 3𝑥3
Subject to 2𝑥1 + 𝑥2 + 3𝑥3 = 7
𝑥1 − 𝑥2 + 4𝑥3 = 3
𝑥1 , 𝑥2 , 𝑥3 ≥ 0
the solution 𝑥1 = 1, 𝑥2 = 2, 𝑥3 = 1 is
(a) feasible but not basic (b) basic but not feasible
(c) feasible as well as basic (d) neither feasible nor basic
25. Which one of the following is not true?
(a) The optimal solution of an LPP, when finite, can always be determined from the extreme points of the
solution space.
(b) In a two-dimensional LPP, the objective function can assume the same value at two distinct extreme
points.
(c) Changes in the coefficients of the objective function will definitely result in changing the optimal values
of the variables
(d) In real life situations, the variables of an LPP can be unrestricted in sign.
26. Let 𝑥 = {(𝑥, 𝑦)|𝑥 2 + 𝑦 2 = 1} and 𝑦 is the set of all convex combinations of the vertices of a cube. Then
(a) 𝑥 is a convex polyhedron, but 𝑦 is not
(b) 𝑥 is not convex polyhedron, but 𝑦 is.
(c) both 𝑥 and 𝑦 are convex polyhedron.
(d) neither 𝑥 nor 𝑦 is a convex polyhedron.
27. The number of extreme points of the convex set 𝑆 = {(𝑥, 𝑦): |𝑥 | ≤ 1, |𝑦| ≤ 1} is
(a) 0 (b) 4
(c) 2 (d) infinitely many
28.For the system of equation
2𝑥1 − 𝑥2 + 3𝑥3 = 3
−6𝑥1 + 3𝑥2 + 7𝑥3 = −9
3
The solution 𝑥1 = 2 , 𝑥1 = 0, 𝑥1 = 0 is

(a) basic feasible but non-degenerate solution

(b) basic feasible but degenerate solution
(c) non-basic feasible but degenerate solution
(d) non-basic, non-degenerate solution
29.For the LPP Max 𝑍 = 20𝑥1 + 9𝑥2
Subject to
2𝑥1 + 2𝑥2 ≥ 36
6𝑥1 + 𝑥2 ≥ 60
𝑥1 ≥ 0,𝑥2 ≥ 0
The minimum value of 𝑍 is
(a) 360 at (18,0)
(b) 336 at (6,4)
(c) 540 at (0,60)
(d) 0 at (0,0)
30. In solving the LPP Min 𝑍 = 6𝑥 + 10𝑦
Subject to
2𝑥 + 𝑦 ≥ 10
𝑥≥6
𝑦≥2
𝑥 ≥ 0,𝑦 ≥ 0
The redundant constraints are
(a) 𝑥 ≥ 6 , 𝑦 ≥ 2
(b) 2𝑥 + 𝑦 ≥ 10 , 𝑥 ≥ 0, 𝑦 ≥ 0
(c) 𝑥 ≥ 6
(d) none of these
31. For the following LPP Max 𝑍 = 2𝑥1 + 3𝑥2
Subject to
3𝑥1 + 𝑥2 ≤ 3
𝑥1 ≥ 0,𝑥2 ≥ 0
The optimal value of the objective function will be
(a) 2
(b) 9
(c) 3
(d) 1
32. Which of the following is a convex set with infinite number of extreme points
(a) {(𝑥1 , 𝑥2 ): 𝑥12 + 𝑥22 = 16}
(b) {(𝑥1 , 𝑥2 ): 𝑥12 + 𝑥22 < 16}
(c) {(𝑥1 , 𝑥2 ): 𝑥12 + 𝑥22 ≤ 16}
(d) {(𝑥1 , 𝑥2 ): 𝑥12 + 𝑥22 > 16}
33. The intersection of two convex sets is
(a) a convex set
(b) is not a convex set
(c) may or may not be convex set
(d) none of these
34. The following LPP Max 𝑍 = 𝑥1 + 𝑥2
Subject to
𝑥1 + 𝑥2 ≤ 1
−3𝑥1 + 𝑥2 ≥ 3
𝑥1 ≥ 0,𝑥2 ≥ 0
has
(a) one feasible solution
(b) two feasible solution
(c) infinite no of feasible solution
(d) no feasible solution

35. Consider two sets 𝑋 = {(𝑥1 , 𝑥2 )|𝑥1 + 𝑥2 ≤ 2,2𝑥1 + 2𝑥2 ≥ 8, 𝑥1 , 𝑥2 ≥ 0} and

{𝑌 = 𝑦: |𝑦| ≤ 2}
Then
(i) X is a convex set, but Y is not a convex set.
(ii) X is not a convex set, but Y is a convex set.
(iii) both X and Y are convex sets.
(iv) none of X and Y are convex sets.
36. Suppose that the objective function of an L.P.P. assumes its optimal value at more than one extreme
point. Then
(a) the convex combination of these extreme points will improve the value of the objective function.
(b) the value of the objective function will be different for different convex combinations of these
extreme points.
(c) it indicates that the number of basic feasible solutions is degenerate.
(d) every convex combination of these extreme points also gives the optimal value of the objective function.
37. The optimal solution of the following LPP
is given by Max 𝑍 = 𝑥1 + 5𝑥2
Subject to
3𝑥1 + 4𝑥2 ≤ 6
𝑥1 + 3𝑥2 ≥ 3
𝑥1 ≥ 0,𝑥2 ≥ 0

6 3
(a) 𝑥1 = 5 , 𝑥2 = 5
(b) 𝑥1 = 0 , 𝑥2 = 1
(c) 𝑥1 = 2 , 𝑥2 = 0
3
(d) 𝑥1 = 0 , 𝑥2 = 2
38. The union of two convex sets is
(a) a convex set
(b) is not a convex set
(c) may or may not be convex set
(d) none of these
39. If any of the constraints in the primal problem be a perfect equality then the corresponding dual variable
is
(a) unrestricted in sign
(b) positive
(c) negative
(d) zero

40. Which of the following is true in an LPP?

(a) Min Z= - Max(-Z) (b) Min Z= - Max Z
(c) Min Z= Max(-Z) (d) none of these
41. The number of optimal solutions of the LPP
𝑀𝑎𝑥 𝑍 = 6𝑥1 + 10𝑥2
Subject to 3𝑥1 + 5𝑥2 ≤ 10
5𝑥1 + 3𝑥2 ≤ 15
𝑥1 , 𝑥2 ≥ 0
(a) one (b) two
(c) finite (d) infinite
42. The maximum number of basic solutions of the following liner equations
4𝑥1 + 2𝑥2 + 3𝑥3 − 8𝑥4 = 6
3𝑥1 + 5𝑥2 + 4𝑥3 + 6𝑥4 = 8
(a) 2
(b) 3
(c) 4
(d) 6

43. Consider the following L.P.P

Max 𝑧 = 6𝑥 − 4𝑦
Subject to 2𝑥 + 4𝑦 ≤ 4
4𝑥 + 8𝑦 ≥ 16
𝑥, 𝑦 ≥ 0
This L.P.P has
(a) infeasible solution
(b) unbounded solution
(c) basic feasible solution
(d) feasible solution

44. The value of a two-person zero sum game is

-2 5
7 -6

16 23 13 23
(a) 9 (b) 20 (c) (d) 18
5

45. Consider the following L.P.P

Max 𝑧 = 6𝑥 − 4𝑦
Subject to 2𝑥 + 4𝑦 ≤ 4
 4𝑥 + 8𝑦 ≥ 16
𝑥, 𝑦 ≥ 0
This L.P.P has
(a) infeasible solution
(b) unbounded solution
(c) basic feasible solution
(d) feasible solution

46. The feasible solution of a L.P.P belongs to

(a) first and second quadrant
(b) first and third quadrant
(c) only first quadrant
(d) only second quadrant

47. The constraints −𝑥 + 𝑦 ≤ 1, −𝑥 + 3𝑦 ≤ 9 and 𝑥, 𝑦 ≥ 0 defined on

(a) bounded feasible space
(b) unbounded feasible space
(c) both bounded and unbounded feasible space
(d) none of these

48. While solving a LPP what is the maximum number of basic solutions that can be obtained from 𝑛
variables and 𝑚 equation where 𝑛 > 𝑚
𝑛!
(a) 𝑚!(𝑛−𝑚)!
𝑚!
(b) 𝑛!(𝑛−𝑚)!
𝑛!
(c) 𝑚!(𝑛+𝑚)!
𝑚!
(d) 𝑛!(𝑛+𝑚)!

49.What happens when maximin and minimax values of the game are same?
(a)no solution exists
(b)solution is mixed
(c)saddle point exists
(d)none of these
50. A feasible solution to an LP 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.
Questions for Broad Question in LPP

1. Solve the following L.P.P graphically

Minimize 𝑍 = −2𝑥 + 𝑦
Subject to 𝑥 + 𝑦 ≥ 6
3𝑥 + 2𝑦 ≤ 16
𝑦≤9
𝑥, 𝑦 ≥ 0
2. Solve the following L.P.P graphically
Maximize 𝑍 = 2𝑥 + 3𝑦
Subject to −𝑥 + 2𝑦 ≤ 4
𝑥+𝑦≤6
𝑥 + 3𝑦 ≥ 9
𝑥, 𝑦 ≥ 0
3. Solve the following L.P.P graphically
Maximize 𝑍 = 20𝑥 + 10𝑦
Subject to 𝑥 + 2𝑦 ≤ 40
3𝑥 + 𝑦 ≥ 30
4𝑥 + 3𝑦 ≥ 60
𝑥, 𝑦 ≥ 0

4. Solve the following L.P.P graphically

Maximize 𝑍 = 4𝑥 + 3𝑦
Subject to 𝑥 + 𝑦 ≤ 50
𝑥 + 2𝑦 ≤ 80
𝑥 + 𝑦 ≥ 20
𝑥, 𝑦 ≥ 0
5.Find all basic solutions to the system of liner equations:
2𝑥1 + 𝑥2 − 𝑥3 = 2
3𝑥1 + 2𝑥2 + 𝑥3 = 3
6. Find all basic solutions to the system of liner equations:
2𝑥1 − 5𝑥2 + 𝑥3 + 3𝑥4 = 4
3𝑥1 − 10𝑥2 + 2𝑥3 + 6𝑥4 = 14
7. Find all basic solutions to the system of liner equations:
𝑥1 + 2𝑥2 + 3𝑥3 = 6
2𝑥1 + 𝑥2 + 4𝑥3 = 4

8. Show that the vectors (3,0,2), (7,0,9), (4,1,2) form a basis.

9. Apply Simplex process to solve the L.P.P
Maximize 𝑍 = 2𝑥1 − 3𝑥2
Subject to 2𝑥1 + 5𝑥2 ≥ 10
3𝑥1 + 8𝑥2 ≤ 24
𝑥1 , 𝑥2 ≥ 0
10. Examine whether the given set is convex. 𝑆 = {(𝑥1, 𝑥2 ) ∈ 𝐸 2 ; 𝑥1 ≥ 2, 𝑥2 ≤ 3}
11. Using two phase method, show that a feasible solution does not exist to the following problem:
Maximize 𝑍 = 𝑥1 + 2𝑥2 + 3𝑥3
Subject to −2𝑥1 + 𝑥2 + 3𝑥3 = 2
2𝑥1 + 2𝑥2 + 4𝑥3 = 1
𝑥1 , 𝑥2 , 𝑥3 ≥ 0
12. Solve the L.P.P
Maximize 𝑍 = 5𝑥1 − 2𝑥2 + 𝑥3
Subject to 2𝑥1 + 4𝑥2 + 𝑥3 ≤ 6
2𝑥1 + 𝑥2 + 3𝑥3 ≥ 2
𝑥1 , 𝑥2 ≥ 0, 𝑥3 is unrestricted.
13. Using two phase method, show that a feasible solution does not exist to the following problem:
Minimize 𝑍 = 𝑥1 + 𝑥2
Subject to 3𝑥1 + 2𝑥2 ≥ 30
2𝑥1 + 3𝑥2 ≥ 30
𝑥1 + 𝑥2 ≤ 5
𝑥1 , 𝑥2 ≥ 0

14. Define Convex Set. Show that the set 𝑋 = {𝑥: |𝑥 | ≤ 2} is a convex set.
15. Prove that the set of all feasible solutions of a linear programming problem is a convex set.
16. Solve the following LPP by finding optimal basic feasible solution
Maximize 𝑧 = 𝑥 + 2𝑦 + 4𝑧
Subject to 2𝑥 + 𝑦4𝑧 = 11
3𝑥 + 𝑦 + 5𝑧 = 14
𝑥, 𝑦, 𝑧 ≥ 0
17. Reduce the feasible solution (1,1,1) of the set of equation
𝑥 + 𝑦 + 2𝑧 = 4
2𝑥 − 𝑦 + 𝑧 = 0
to a basic feasible solution.

18. Check whether the following LPPs are in Canonical form or not? Those which are in Canonical form convert
them into standard form and those which are not in Canonical form rewrite them in Canonical form then convert
them into standard form.
(i) Maximize 𝑧 = 𝑥 + 2𝑦 + 4𝑧
Subject to 2𝑥 + 𝑦 + 4𝑧 ≤ 11
3𝑥 + 𝑦 + 5𝑧 ≥ 14
𝑥 + 8𝑦 + 7𝑧 ≥ 4
𝑥, 𝑦, 𝑧 ≥ 0
(ii) Minimize 𝑧 = 3𝑥 + 𝑦 + 8𝑧
Subject to 𝑥 + 2𝑦 + 7𝑧 ≥ 5
5𝑥 + 𝑦 + 3𝑧 ≤ 4
2𝑥 + 𝑦 + 𝑧 ≥ 9
𝑥, 𝑦, 𝑧 ≥ 0
(iii) Max 𝑧 = 5𝑥 + 𝑦 + 7𝑧
Subject to 𝑥 + 9𝑦 + 𝑧 ≤ 15
8𝑥 + 3𝑦 + 6𝑧 ≤ 8
𝑥, 𝑦, 𝑧 ≥ 0
19. Solve the following LPP by Simplex method
Maximize 𝑧 = 4𝑥 + 10𝑦
Subject to 2𝑥 + 𝑦 ≤ 50
2𝑥 + 5𝑦 ≤ 100
2𝑥 + 3𝑦 ≤ 90
𝑥, 𝑦 ≥ 0
20. Solve the following LPP by Simplex method
Minimize 𝑧 = 𝑥 − 3𝑦 + 2𝑧
Subject to 3𝑥 − 𝑦 + 2𝑧 ≤ 7
−2𝑥 + 4𝑦 ≤ 12
−4𝑥 + 3𝑦 + 8𝑧 ≤ 10
𝑥, 𝑦, 𝑧 ≥ 0
21. Check whether the given set is convex.
𝑆 = {(𝑥1, 𝑥2 ) ∈ 𝐸 2 ; 2𝑥1 + 𝑥2 ≥ 20, 𝑥1 + 2𝑥2 ≤ 80, 𝑥1 + 𝑥2 ≤ 50, 𝑥1, 𝑥2 ≥ 0
22. Write the dual of the following LPP
Maximize 𝑧 = 𝑥 − 3𝑦 + 2𝑧
Subject to 3𝑥 − 𝑦 + 2𝑧 ≤ 7
−2𝑥 + 4𝑦 = 12
 −4𝑥 + 3𝑦 + 8𝑧 ≤ 10
𝑥, 𝑦 ≥ 0 𝑧 is unrestricted variable
23. Use Big M method to solve
Minimize 𝑧 = 4𝑥1 + 2𝑥2
Subject to 3𝑥1 + 2𝑥2 ≥ 27
𝑥1 + 𝑥2 ≥ 21
𝑥1 + 2𝑥2 ≥ 30
𝑥1 , 𝑥2 ≥ 0
23. Use Big M method to solve
Minimize 𝑧 = 4𝑥1 + 𝑥2
Subject to 3𝑥1 + 𝑥2 = 3
4𝑥1 + 3𝑥2 ≥ 6
𝑥1 + 2𝑥2 ≤ 3
𝑥1 , 𝑥2 ≥ 0
24. Write the dual of the following LPP
Maximize 𝑧 = 2𝑥 + 5𝑦 + 6𝑧
Subject to 5𝑥 + 6𝑦 − 𝑧 ≤ 3
−2𝑥 + 𝑦 + 4𝑧 ≤ 4
𝑥 − 5𝑦 + 3𝑧 ≤ 1
−3𝑥 − 3𝑦 + 7𝑧 ≤ 6
𝑥, 𝑦, 𝑧 ≥ 0
25. A salesman has to visit five cities A, B, C, D, E. The distances (in hundred kilometres) between the cities are
as follows:
A B C D E
A ∞ 14 12 16 8
B 14 ∞ 16 10 12
C 12 16 ∞ 18 14
D 16 10 18 ∞ 16
E 8 12 14 16 ∞
If the salesman starts from city A and has to come back at city A, which route should he select so that the total
distance travelled is minimum?
26. Using Graphical method, find the optimal strategies for both persons and the value of the game for zero sum
2-person game, whose pay-off matrix is as follows.
Player
B
1 -3
3 5
-1 6
Player 4 1
A 2 2
-5 0

27. Apply Simplex process to solve the L.P.P

Maximize 𝑍 = 2𝑥 + 3𝑦
Subject to 𝑥 + 𝑦 ≤ 8
𝑥 + 2𝑦 = 5
2𝑥 + 𝑦 ≤ 8
𝑥, 𝑦 ≥ 0

28. Construct the dual of the following primal problem

Maximize 𝑍 = 6𝑥1 + 5𝑥2 + 10 𝑥3
Subject to 4𝑥1 + 5𝑥2 + 7 𝑥3 ≤ 5
 3𝑥1 + 7 𝑥3 ≤ 10
2𝑥1 + 𝑥2 + 8 𝑥3 = 20
2𝑥2 + 9 𝑥3 ≥ 5
𝑥1 , 𝑥3 ≥ 0𝑥2 is unrestricted in sign

29. Apply (i)Vogel’s approximation method and (ii) Row minima method to find the basic feasible solution of the
following transportation problem

1 2 3 4 𝑎𝑗
1 21 16 25 13 11
2 17 18 14 23 13
3 32 27 18 41 19
𝑏𝑗 6 10 12 15

30. Use dominance to reduce the payoff matrices and solve the games with the following payoff matrices

B
0 0 0 0 0 0
4 2 0 2 1 1
A 4 3 1 3 2 2
4 3 7 -5 1 2
4 3 4 -1 2 2
4 3 3 -2 2 2

31. Apply the maximin and minimax principle to solve the game whose payoff matrix is given below
𝐵
𝐵1 𝐵2 𝐵3
𝐴1 15 2 3
𝐴 𝐴2 6 5 7
𝐴3 -7 4 0

32. Determine an initial basic feasible solution to the following balanced transportation problem by column
minima method:
A B C D
A 5 3 6 2 19
B 4 7 9 1 37
C 3 4 7 5 34
16 18 31 25
33. A machine operator processes five types of items on his machine each week and must choose a sequence for
them. The set up cost per change depends on items presently on the machine and set up to be made according to
the following table:
A B C D E
A ∞ 4 7 3 4
B 4 ∞ 6 3 4
C 7 6 ∞ 7 5
D 3 3 7 ∞ 7
E 4 4 5 7 ∞
If he processes each type of item once and only once each week, how should he sequence the items on his
machine in order to minimize the total set up cost?