Industrial Engineering & Operations Research

 Pattern of Questions:
1 – Mark Questions (MCQ’s) – 30 (30 x 1 = 30 Marks)
2 – Mark Questions (MCQ’s & NAT) – 35 (35 x 2 = 70 Marks)
* Out of 100 Marks 15 marks MCQ’s will be in Aptitude and
Reasoning.
* Out of 100 Marks 15 marks (approximately) MCQ’s will be in
mathematics.
* Around 70 Marks (approximately) MCQ’s & NATs will be on
Mechanical Engineering/PI Subjects.
* IM & OR maximum of 6 marks in Mechanical Engineering Paper.
* IM & OR maximum of 20-22 marks in Production Engineering
Paper.
* Negative marking of 1/3th for each wrong answer in MCQ.
* No negative marking for NAT questions.
 Topics to be covered
Day 1
 Linear Programming
 Simplex Method
Day 2
 Transportation Problem
 Assignment Models
 Simple Queuing Models
Day 3
 CPM & PERT
Day 4
 Inventory Control Models
 Safety Stock inventory control systems
 Forecasting models, product design and development
Day 5
 Production planning & Control
 Aggregate Production Planning
 Scheduling & Material Requirement Planning
 Facility design & Assembly line balancing
 Work Study
Day 6
 Revision
 Important and Old questions Solving
 Optimal Solution lies at one of the corner points of the feasible
solution.
 Feasible region must be a convex polygon and it is bounded by
lines or planes.
1. A firm manufactures headache pills in two sizes A and B. Size
A contains 2 grains of aspirin, 5 grains of bicarbonate and 1
grain of codeine. Size B contains 1 grain of aspirin, 8 grains of
bicarbonate and 6 grains of codeine. It is found by users that it
requires atleast 12 grains if aspirin, 74 grains of bicarbonate and
24 grains of codeine for providing immediate effect. It is
required to determine the least number of pills a patient should
take to get immediate relief. Formulate the problem as a
standard LPP.
(Ans. Min z = x1 + x2; subject to 2x1 + x2 ≥ 12, 5x1 + 8x2 ≥ 74,
x1 + 6x2 ≥ 24; x1, x2 ≥0)

2. A manufacturer has three machines A,B,C with which he

produces three different articles P,Q, R. The different machine
times required per article, the amount of time available in any
week on each machine and the estimated profits per article are
furnished in the following table:
Machine Time Profit per
Article (in hrs.) article in
A B C rupees
P 8 4 2 20
Q 2 3 0 6
R 3 0 1 8
Available
250 150 50
machine hrs.
Formulate the problem as a linear programming problem.
(Ans. Max. z = 20P + 6Q + 8R; Subject to 8P + 2Q + 3R ≤ 250,
4P + 3Q ≤ 150, 2P + R ≤ 50; P, Q, R ≥ 0)
 Duality in LPP
Unique Optimal Solution Unique optimal with
Opposite Sign
Multiple Optimal Degenerate
Degenerate Multiple Optimal
Un-bounded Infeasible
Infeasible Un-bounded
Z max Z min
Simplex Method Example 4.7 Solve the LPP.
Minimize Z = 4x1 + x2
Subject to, 3x1 + x2 = 3
NOTES 4x1 + 3x2  6
x1 + 2x2  4
x1, x2  0
Solution Since the objective function is minimization, we covert it into
maximization using,
Min Z = – Max (– z) = –Max z* ( Z* = – Z)
Maximize z* = – 4x1 – x2
Subject to, 3x1 + x2 = 3
4x1 + 3x2  6
x1 + 2x2  4
x1, x2  0
Convert the given LPP into standard form by adding artificial variables A1,
A2, surplus variable S1 and slack variable S2 to get the initial basic feasible solution.
Minimize Z* = – 4x1 – x2 + 0S1 + 0S2 – MA1 – MA2
Subject to, 3x1 + x2 + A1 = 3
4x1 + 3x2 – S1 + A2  6
x1 + 2x2 + S2 = 4
x1x2, S1S2, A1A2  0
The starting feasible solution is A1 = 3, A2 = 6, S2 = 4.
Initial solution

Since some of the Zj – Cj  0, the current feasible solution is not optimum. As

Z1 – C1 is most negative, x1 enters the basis and the basic variable A1 leaves
the basis.

Self-Instructional
80 Material
First iteration Simplex Method

NOTES

Since Z1 – C1 is negative, the current feasible solution is not optimum. Therefore,

x1 variable enters the basis and the artificial variable A2 leaves the basis.
Second iteration

Since Z4 – C4 is most negative, S1 enters the basis and the artificial variable A1
leaves the basis.
Third iteration

Since Z4 – C4 is most negative, S2 enters the basis and S1 leaves the basis.
Self-Instructional
Material 81
Simplex Method Fourth iteration

NOTES

Since all Zj – Cj  0, the solution is optimum and is given by x1 = 3/5, x2

= 6/5, and Max Z = – 18/5
 Min Z = – Max ( – Z) = 18/5.
Example 4.8 Solve by Big M method.
Maximize Z = x1 + 2x2 + 3x3 – x4
Subject to, x1 + 2x2 + 3x3 = 15
2x1 + x2 + 5x3 = 20
x1 + 2x2 + x3 + x4 = 10
Solution Since the constraints are equations, introduce artificial variables A1,
A2  0. The reformulated problem is given as follows.
Maximize Z = x1 + 2x2 + 3x3 – x4 – MA1 – MA2
Subject to,x1 + 2x2 + 3x3 + A1 = 15
2x1 + x2 + 5x3 + A2 = 20
x1 + 2x2 + x3 + x4 = 10
Initial solution is given by A1 = 15, A2 = 20 and x4 = 10.

Since Z3 – C3 is most negative, x3 enters the basis and the basic variable
A2 leaves the basis.

Self-Instructional
82 Material
Ans 10

2020

Q.51 T he minimum value of 3𝑥 + 5𝑦

such that:
3𝑥 + 5𝑦 ≤ 15
4𝑥 + 9𝑦 ≤ 8
13𝑥 + 2𝑦 ≤ 2
𝑥 ≥ 0, 𝑦 ≥ 0
is _______.

2018

Ans :0 –zero

Ans : B

2018
Ans : C

2019
GATE 2016 SET 3
ANS:- 39000 to 41000
2 Marks Q

Ans. 15

Ans. 17 to 19

Ans. 0
Ans. 40,000
 Ans. B

Ans. D
Ans. A

Ans. 40