Question Bank 2024-25 GIFT (Autonomous), Bhubaneswar

Subject Name: OE Subject Code: MB-T-BC-105

MODULE –I,II,III

Questions Marks CO BTL

1 1. What do you mean by a general LPP? 2 1 1

2. Write down the matrix form of general LPP. 2 1 1

3. Define feasible region. 2 1 1

4. Define a feasible solution. 2 1 1

5. What is the difference between feasible solution and basic feasible 2 1 1

solution?

6. Define optimal solution? 2 1 1

7. What is the difference between non-degenerate and degenerate solution. 2 1 1

8. Define unbounded solution?. 2 1 1

9. What are the two forms of LPP? 2 1 1

10.What do you mean the canonical form of LPP? 2 1 1

11.What do you mean the standard form of LPP? 2 1 1

12.What are the limitations of LPP? 2 1 1

13.What is the slack and surplus variable? 2 1 1

14.How many basic feasible solutions are there to a given system of 4 2 1 1

simultaneous equations in 5 unknown?
15.. What is the test of optimality in the simplex method? 2 1 1

16.What is pivot element and how is it selected? 2 1 1

17.What is outgoing vector and how is it selected? 2 1 1

18.When does the simplex method indicate that the LPP has unbounded 2 2 1
solution?
19.What is mean by optimality? 2 2 1

20.How will you find whether a LPP has got an alternative optimal solution 2 2 1
or not, from the optimal simplex table?
21.What is the method using to solve an LPP involving artificial variables? 2 2 1

22.Define artificial variable? 2 2 1

ENGLISH FOR EINGEERS II

 23.What are the methods used to solve an LPP involving artificial
variables?

24.What is the objective of BIG-M method?

25.What do you understand by transportation problem? 2 3 1

26.Define feasible, basic feasible solution of a transportation problem? 2 3 1

27. 2 3 1

28.Write the standard form of the following LPP

𝑀𝑖𝑛 𝑍 = 20𝑥 + 10𝑦
Subject to constraints 𝑥 + 2𝑦 ≤ 40
3𝑥 + 𝑦 ≥ 30
4𝑥 + 3𝑦 ≥ 60
𝑥, 𝑦 ≥ 0

29.Define optimal solution for transportation problem? 2 3 1

30.. . What is the purpose of MODI method? 2 3 1

31.When does a transportation problem have unique solution? 2 3 1

32.What do you mean by degeneracy in a T.P? 2 3 1

33.What do you mean by an unbalanced T.P? 2 3 1

34.How do you convert an unbalanced T.P. into a balanced one? 2 3 1

35.What is an assignment problem? Give two applications. 2 3 1

36.State difference between the T.P and the A.P. 2 3 1

37.State difference between the T.P and the A.P. 2 3 1

38.How do you convert the maximization assignment problem into a 2 3 1

minimisation.

39.What is the name of the method used in getting the optimum assignment 2 3 1

40.When is an A.P. said to be unbalanced? How do you make it a 2 3 1

balanced?

41.How do you solve an A.P., if the profit is to be maximized? 2 3 1

42.Write general form of assignment problem 2 3 1

43.How do you solve an A.P., if the profit is to be maximized? 2 3 1

BTL
Section B
1 A person requires 10,12 and 12 units of chemicals A,B and C respectively for 6 1 2

ENGLISH FOR EINGEERS II

 his garden. A liquid product contains 5, 2 and 1 units of A, B, and C,
respectively, per jar. A dry product contains 1,2 and 4 units of A,B,C per
carton. If the liquid product is sold for 3Rs per jar and the dry product is sold
for 2Rs per carton, how many units of each product should be purchased, in
order to minimize the cost and meet the requirements?

2 One kind of cake requires 200g of flour and 25g of fat, and another kind of 6 1 2
cake requires 100g of flour and 50g of fat. Find the maximum number of
cakes that can be made from 5kg of flour and 1 kg of fat assuming that there
is no shortage of the other ingredients used in making the cakes.

3 Reshma wishes to mix two types of food P and Q in such a way that the 6 1 2
vitamin contents of the mixture contain at least 8 unit of vitamin A and 11
units of vitamins B. Food P costs Rs 60/kg and food Q costs Rs 80/kg. Food
P contains 3unit/Kg of vitamin A and 5 unit/kg of vitamins B while food Q
contains 4unit/kg of vitamin A and 2 units/kg of vitamins B. Determine the
minimum cost of the mixture.

4 A manufacture produces two types of Models M1 and M2. Each model of type 6 1 2
M1 requires 4 hrs of grinding and 2hrs of polishing, whereas each model of
the type M2 requires 2 hrs of grinding and 5 hrs of polishing. The
manufactures have 2 grinders and 3 polishers. Each grinder works 40 hrs a
week and each polisher’s works 60 hours a week. Profit on M1 model is
Rs.3.00 and on model M2 is Rs.4.00.Whatever is produce in a week is sold in
the market.How should the manufacture allocate his production capacity to
the two types of models,so that he may make the maximum profit in a week.

5 Two products ‘A’ and ‘B’ are to be manufactured. Single unit of ‘A’ requires 6 1 2
2.4 minutes of punch press time and 5 minutes of assembly time, while single
unit of ‘B’ requires 3 minutes of punch press time and 2.5 minutes of welding
time. The capacity of punch press department, assembly department and
welding department are 1200 min/week, 800 min/week and 600 min/week
respectively. The profit from ‘A’ is ₹60 and from ‘B’ is ₹70 per unit.
Formulate LPP such that, profit is maximized.
6 Write the limitation and procedure of graphical method? 6 1 2

7 Solve the following LPP by Graphical Method 6 1 2

MinZ = 3x1 + 2 x2
Subject to constraints 5 x1 + x2  10
x1 + x2  6
x1 + 4 x2  12
x1, x2  0

8 Solve the following LPP by Graphical Method 6 1 2

𝑀𝑖𝑛 𝑍 = 20𝑥 + 10𝑦
Subject to constraints 𝑥 + 2𝑦 ≤ 40
3𝑥 + 𝑦 ≥ 30
4𝑥 + 3𝑦 ≥ 60

ENGLISH FOR EINGEERS II

 𝑥, 𝑦 ≥ 0

9 Solve the following LPP by Graphical Method 6 1 2

𝑀𝑎𝑥 𝑍 = 100𝑥 + 40𝑦
Subject to constraints 5𝑥 + 2𝑦 ≤ 1000
3𝑥 + 2𝑦 ≤ 900
𝑥 + 2𝑦 ≤ 500
𝑥, 𝑦 ≥ 0.

10 Solve the following LPP by Graphical Method 6 1 2

𝑀𝑎𝑥 𝑍 = 3𝑥 + 2𝑦
Subject to constraints 𝑥−𝑦 ≥ 1
𝑥+𝑦 ≥3
𝑥, 𝑦 ≥ 0
.

11 Solve the following LPP by Graphical Method 6 1 2

𝑀𝑎𝑥 𝑍 = 8𝑥 + 𝑦
Subject to constraints 𝑥 + 𝑦 ≤ 40
2𝑥 + 𝑦 ≤ 60
𝑥, 𝑦 ≥ 0
.

12 Solve the following LPP by Graphical Method 6 1 2

𝑀𝑖𝑛 𝑍 = 3𝑥 − 2𝑦
Subject to constraints −2𝑥 + 3𝑦 ≤ 9
𝑥 − 5𝑦 ≥ −20
𝑥, 𝑦 ≥ 0

13 6 1 2

14 Solve the following LPP by Simplex Method 6 1 2

𝑀𝑎𝑥 𝑍 = 3𝑥 + 2𝑦
Subject to constraints 𝑥+𝑦 ≤ 4
𝑥−𝑦 ≤2
𝑥, 𝑦 ≥ 0

15 Solve the following LPP by Simplex Method 6 1 2

𝑀𝑎𝑥 𝑍 = 3𝑥 + 2𝑦
Subject to constraints 4𝑥 + 3𝑦 ≤ 12
4𝑥 + 𝑦 ≤ 8
4𝑥 − 𝑦 ≤ 8
𝑥, 𝑦 ≥ 0

16 Solve the following LPP by Simplex Method

𝑀𝑖𝑛 𝑍 = 12𝑥 + 16𝑦
Subject to constraints 𝑥 + 2𝑦 ≤ 40
𝑥 + 𝑦 ≤ 30
𝑥, 𝑦 ≥ 0
ENGLISH FOR EINGEERS II
17 Solve the following LPP by BIG-M Method
𝑀𝑎𝑥 𝑍 = 3𝑥 + 2𝑦
Subject to constraints 2𝑥 + 𝑦 ≤ 2
3𝑥 + 4𝑦 ≥ 12
𝑥, 𝑦 ≥ 0

18 Solve the following LPP by BIG-M Method

𝑀𝑖𝑛 𝑍 = 4𝑥 + 𝑦
Subject to constraints 3𝑥 + 𝑦 = 3
4𝑥 + 3𝑦 ≥ 6
𝑥 + 2𝑦 ≤ 4
𝑥, 𝑦 ≥ 0

19 Solve the following LPP by BIG-M Method

𝑀𝑖𝑛 𝑍 = 𝑥1 + 𝑥2
Subject to constraints 2𝑥1 + 𝑥2 + 𝑥3 = 4
𝑥1 + 𝑥2 + 2𝑥3 = 2
𝑥1 , 𝑥2, 𝑥3 ≥ 0
20 Convert to Dual from the Primal. 6 2 2
MaxZ = x1 + 2 x2 + x3
Subjectto :
2 x1 + x2 − x3  2
−2 x1 + x2 − 5 x3  −6
4 x1 + x2 + x3  6
x1 , x2 , x3  0

21 MaxZ = 3 x1 − x2 + x3 6 2 2
Subjectto :
4 x1 − x2  8
Write the dual of the Primal
8 x1 + x2 + 3 x3  12
5 x1 − 6 x3  12
x1 , x2 , x3  0

22 MinZ = 2 x2 + 5 x3 6 2 2
Subjectto :
x1 + x2  2
Write the dual of the Primal
2 x1 + x2 + 6 x3  6
x1 − x2 + 3x3 = 4
x1 , x2 , x3  0

23 6 2 2

ENGLISH FOR EINGEERS II

24 Find the initial basic feasible solution of a transportation problem whose cost 6 2 2
and rim requirement table is given below.

Origin/Des D1 D2 D3 Supply
tination

O1 2 7 4 5

O2 3 3 1 8

O3 5 4 7 7

O4 1 6 2 14

Demand 7 9 18

25 Find the initial basic feasible solution of a transportation problem by NWCR 6 2 2

Origin/Desti D1 D2 D3 D4 Supply
nation

O1 6 4 1 2 14

O2 8 9 2 7 16

O3 4 3 6 2 5

Demand 6 10 15 4

26 Obtained an initial feasible solution by least cost method/matrix minima 6 2 2

method.

Origin/Desti D1 D2 D3 D4 Supply
nation

O1 1 2 3 4 6

O2 4 3 2 0 8

O3 0 2 2 1 10

Demand 4 6 8 6

27 Solve the following assignment problem. 6 2 2

Origin/Desti A B C D
nation

1 1 4 6 3

2 9 7 10 9

3 4 5 11 7

4 8 7 8 5

28 6 2 2

ENGLISH FOR EINGEERS II

29 6 2 2

MaxZ = −3x1 − x2
Subjectto :
Solve by Dual simplex method x1 + x2  1
2 x1 + 3 x2  2
x1 , x2  0

30 MinZ = 5 x1 + 6 x2 6 2 2
Subjectto :
Solve by Dual simplex method x1 + x2  2
2 x1 + 3 x2  4
x1 , x2  0

31 MaxZ = −3 x1 − 2 x2 6 2 2
Subjectto :
x1 + x2  1
Solve by Dual simplex method
x1 + x2  7
x1 + 2 x2  10
x1 , x2  0

32 Find the assignment of mechanics to the job that will result in maximum 6 2 2
profit.

JOB/MECH A B C D E
INE

1 62 78 50 14 82

2 71 84 61 73 59

3 87 92 111 71 81

4 48 64 87 77 80

33 Use the Hungarian method to solve the given assignment problem stated in the table. 6 2 2
The entries in the matrix represent each man’s processing time in hours.

JOB/MEN I II III IV V

1 20 15 18 20 25

2 18 20 12 14 15

3 21 23 25 27 25

34 Solve the LPP 6 2 2

ENGLISH FOR EINGEERS II

 MaxZ = 2 x1 + x2
Subjectto :
x1 + 5 x2  10
x1 + 3 x2  6
x1 , x2  0

Section C

1 8 1 3
A calculator company produces a handheld calculator and a scientific calculator.
Long-term projections indicate an expected demand of at least 150 scientific and
100 handheld calculators each day. Because of limitations on production
capacity, no more than 250 scientific and 200 handheld calculators can be made
daily. To satisfy a shipping contract, a minimum of 250 calculators must be
shipped each day. If each scientific calculator sold, results in a 20 rupees loss, but
each handheld calculator produces a 50 rupees profit; then how many of each
type should be manufactured daily to maximize the net profit?

2 A tailor prepares two kinds of dresses. First kind of dress is having raw 8 1 3
material cost of ₹150 and labour cost of ₹80, while the second kind of dress is
raw material cost of ₹250 and labour cost of ₹100. He can sell the dresses of
first and second kind at the rate of ₹300 and ₹500 respectively. First kind of
dress takes 2 hours and second kind takes 2.5 hours of cutting. The total labour
hours are restricted to 84 hours/week. Also, first kind of dress takes 1.5 hours
of stitching and second requires 2 hours of stitching. The stitching hours are
restricted to 60 hours/week. Formulate LPP, such that maximum profit can be
earned by tailor
3 Solve the following LPP by Graphical Method 8 1 3
𝑀𝑖𝑛 𝑍 = 50𝑥 + 60𝑦
Subject to constraints 2𝑥 + 𝑦 ≤ 300
3𝑥 + 4𝑦 ≥ 509
4𝑥 + 7𝑦 ≥ 812
𝑥, 𝑦 ≥ 0
4 Solve by Dual simplex method 8 1 3
𝑀𝑖𝑛 𝑍 = 600𝑥 + 500𝑦
Subject to constraints 2𝑥 + 𝑦 ≥ 80
𝑥 + 2𝑦 ≥ 60
𝑥, 𝑦 ≥ 0.

5 Solve the following LPP by Simplex Method 8 1 3

𝑀𝑎𝑥 𝑍 = 𝑥1 + 𝑥2 + 3𝑥3
Subject to constraints 3𝑥1 + 2𝑥2 + 𝑥3 ≤ 3
2𝑥1 + 𝑥2 + 2𝑥3 ≤ 2
𝑥1 , 𝑥2, 𝑥3 ≥ 0
6 Solve the following LPP by Simplex Method 8 1 3
𝑀𝑖𝑛 𝑍 = 𝑥1 − 3𝑥2 + 2𝑥3
Subject to constraints 3𝑥1 − 𝑥2 + 2𝑥3 ≤ 7
- 2𝑥1 + 4𝑥2 ≤ 12
-4𝑥1 + 3𝑥2 + 8𝑥3 ≤ 10
𝑥1 , 𝑥2, 𝑥3 ≥ 0
ENGLISH FOR EINGEERS II
7 . Solve the following LPP by BIG-M Method 8 1 4
𝑀𝑖𝑛 𝑍 = 600𝑥 + 500𝑦
Subject to constraints 2𝑥 + 𝑦 ≥ 80
𝑥 + 2𝑦 ≥ 60
𝑥, 𝑦 ≥ 0.

8 Solve the following LPP by BIG-M Method 8 1 3

𝑀𝑎𝑥 𝑍 = 𝑥1 + 2𝑥2 + 3𝑥3 − 𝑥4
Subject to constraints 𝑥1 + 2𝑥2 + 3𝑥3 = 15
2𝑥1 + 𝑥2 + 5𝑥3 = 20
𝑥1 + 2𝑥2 + 𝑥3 + 𝑥4 = 10
𝑥1 , 𝑥2, 𝑥3 ≥ 0
9 MaximizeZ = 4 x1 + 5 x2 − 3x3 8 1 3
Subjectto
x1 + x2 + x3 = 22
Write the dual of the following problem
3 x1 + 5 x2 − 2 x3  65
x1 + 7 x2 + 4 x3  120
x1 , x2 , x3  0
10 Write the dual of the following problem: 8 2 4
MaximizeZ = x + 2 y
Subjectto :
2x + 3y  4
3x + 4 y = 5
x  0, y

11 Obtain the initial solution for the following TP using NWCR,LCM and VAM. 8 2 3
Destination/ A B C Supp
Source ly

1 2 7 4 5

2 3 3 1 8

3 5 4 7 7

4 1 6 2 14

12 8 2 3
Obtain the initial solution for the following TP using NWCR,LCM and VAM.
Destination/ A B C Supp
Source ly

1 2 7 4 5

2 3 3 1 8

3 5 4 7 7

4 1 6 2 14

13 Solve the following TP where the cell entries denote the unit transportation 8 2 3
costs.
ENGLISH FOR EINGEERS II
 Destination/ A B C D Supp
Source ly

P 5 4 2 6 20

Q 8 3 5 7 30

R 5 9 4 6 50

Demand 10 40 20 30

14 Determine the optimum assignment schedule for the following assignment 8 2 3

problem. The cost matrix is given below.

JOB/MECH 1 2 3 4 5 6
INE

A 11 17 8 16 20 15

B 9 7 12 6 15 13

C 13 16 15 12 16 8

D 21 24 17 28 2 15

E 14 10 12 11 15 6

15 Solve the assignment problem by using Hungarian method. Assign the job for 8 2 3
different machine so as to minimize total cost.
Mechine/Job A B C D E
s

1 13 8 16 18 19

2 9 15 24 9 12

3 12 9 4 4 4

4 6 12 10 8 13

5 15 17 18 12 20

Section D

1 A company produce two different products, A and B and makes profits of Rs 40 and 10 1 4
Rs 30 per unit respectively. The production process has a capacity of 30000 man-
hours.It takes 3 hours to produce one unit of A and one hour to produce one unit of
B. The market survey indicates that the maximum number of units of products A that
can be sold is 8000 and those of B is 12000.Formulate the problem and solve it by
graphical method to get maximum profit.
2 One kind of cake requires 200g of flour and 25g of fat, and another kind of 10 1 4
cake requires 100g of flour and 50g of fat. Find the maximum number of
cakes that can be made from 5kg of flour and 1 kg of fat assuming that there
is no shortage of the other ingredients used in making the cakes.Formulate the
LPP and the find the maximum number of cake by using graphical mehods.
3 Reshma wishes to mix two types of food P and Q in such a way that the 10 1 4
vitamin contents of the mixture contain at least 8 unit of vitamin A and 11

ENGLISH FOR EINGEERS II

 units of vitamins B. Food P costs Rs 60/kg and food Q costs Rs 80/kg. Food P
contains 3unit/Kg of vitamin A and 5 unit/kg of vitamins B while food Q
contains 4unit/kg of vitamin A and 2 units/kg of vitamins B. Determine the
minimum cost of the mixture by using graphical method.
4 A manufacture produces two types of Models M1 and M2. Each model of type 10 1 4
M1 requires 4 hrs of grinding and 2hrs of polishing, whereas each model of
the type M2 requires 2 hrs of grinding and 5 hrs of polishing. The
manufactures have 2 grinders and 3 polishers. Each grinder works 40 hrs a
week and each polisher’s works 60 hours a week. Profit on M 1 model is
Rs.3.00 and on model M2 is Rs.4.00.Whatever is produce in a week is sold in
the market. How should the manufacture allocate his production capacity to
the two types of models, so that he may make the maximum profit in a week?
Formulate the LPP and solve it by simplex method.
5 Solve by simplex method. 10 1 3
Find solution using Simplex method
𝑀𝑎𝑥 𝑍 = 3𝑥1 − 5𝑥2 + 4𝑥3
Subject to constraints 2𝑥1 + 3𝑥2 ≤ 8
2𝑥2 + 5𝑥3 ≤ 10
3𝑥1 + 2𝑥2 + 4𝑥3 ≤ 15
𝑥1 , 𝑥2 , 𝑥3 ≥ 0

6 Solve the following LPP by BIG-M Method 10 1 3

𝑀𝑎𝑥 𝑍 = 5𝑥1 + 12𝑥2 + 4𝑥3
Subject to constraints 𝑥1 + 2𝑥2 + 𝑥3 ≤ 5
2𝑥1 + 𝑥2 + 3𝑥3 = 2
𝑥1 , 𝑥2 , 𝑥3 ≥ 0
7 Find initial basic feasible solution using Voggel's Approximation method, also find 10 2 3
optimal solution using MODI method,
Destination/ D1 D2 D3 D4 Supp
Source ly

S1 19 30 50 7

S2 70 30 40 60 9

S3 40 8 70 20 18

Demand 5 8 7 14

8 Solve the following TP 10 2 3

Destination/ D1 D2 D3 D4 D5 Supp
Source ly

S1 5 8 6 6 3 8

S2 4 7 7 6 5 5

S3 8 4 6 6 4 9

Demand 4 4 5 4 8

9 Solve the following LPP by BIG-M Method 10 2 3

ENGLISH FOR EINGEERS II

 MaximizeZ = x1 + 2 x2 + 3x3 − x4
Subjectto
x1 + 2 x2 + 3x3 = 15
2 x1 + x2 + 5 x3 = 20
x1 + 2 x2 + x3 + x4 = 10
x1 , x2 , x3 , x4  0
10 Find solution of assignment method using Hungarian Method. 10 2 3
WORK/JOB I II III IV V

A 10 5 13 15 16

B 3 9 18 13 6

C 10 7 2 2 2

D 7 11 9 7 12

E 7 9 10 4 12

** BTL: Bloom’s Taxonomy Level

** CO: Course Outcomes

BTL are:

1. Remembering
2. Understanding,
3. Applying,
4. Analysing,
5. Evaluating
6. Creating

ENGLISH FOR EINGEERS II