Operation Research

Download as pdf or txt
Download as pdf or txt
You are on page 1of 25

Chapter Introduction to

Research
Operations
FROMPUNJAB UNIVERSITY
THEORETIicAL PROBLEMS
2008 APR.[7] Discuss the scope of
ness, finance and Operations Research in busi-
2008 SEP(1] OR management.
is an (Marks 15)
inter-disciplinary approach. DiscusSs.
[7] Define Operation (Marks 5)
techniques Research, give features of OR.
or tools of OR. Briefly discuss
2009 APR.[1] Define Operations Research and (Marks 15)
teristics. discuss its charac
[7] Discuss briefly various steps for (Marks 5)
solving
problem. llustrate with one example from the an
Operations Research
your choice. functional area of
2009 SEP[1] Discuss scope of operations research (Marks 15)
in modern
management.
(7] Explain briefly the main phases of an O.R. (Marks 5)
used in solving O.R. problem. study and techniques
2010 APR.[7] Discuss the meaning, significance and scope of (Marks 15)
Operations Research. Describe methods of Operations Research.
(Marks 15)
2010 SEP.(7] What are essential characteristics of
Operations
Research ? Mention different phases of an O.R. study. Point out
its limitations, if any. (Marks 15)
2011APR.[1] Describe the scope of Operations Research.
(Marks 5)
(7](a) What are the important techniques used in Operations Re-
search ? Give limitations of Operations Research. (Marks 10)
2011 SEPI1] Discuss the methodology of operations research.
(Marks 5)
2012 APR.I7] "Operations Research is the application of Scientific
methods, techniques and tools to problems involving the operations
of a system so as to provide thOse in control of the systems with
optimum solution to the problems." Discuss. (Marks 15)
117
Operations Research DPT Pb4
2012 SEP.[1] Explain the methodology (Processes) of Opera
Research.
detailed note on the role of
(Marks
operations
2013APR.[1] Write a
search models in decision making. (Marks
SEP[7] What the essential characteristics of Operatio
2013 are
Research ? Discuss the role and scope of quantitative methocie
for scientific decision making in business management.

(Marks 15
2014 APR.1] Discuss in detail the methodology of Operations
Research.
7] Write a note on significance and scope of Operations Research
(Marks 5
(Marks 15)
2014 SEP[1] Explain the features of Operations Research app.
roach. (Marks 5)
2015APR.I1] What is Operations Research ? Explain brietly its
applications. (Marks 5)
2015SER1 Explain the features of Operation Research.
(Marks 5)
2016 APR[2] What is Operation Research ? Explain briefly its appli
cations. (Marks 5)
[7] Write a note on significance and scope of Operation Research.
(Marks 15)
2016 SEP[1] Define Operation Research. What are various phases
in process of operation research. (Marks 5)
[7] Write a note on significance and scope of Operations Research.
(Marks 15)
2017MAY[110) Define OR. (Marks 5)
[2] Explain the signitficance and scope of Operational Research
with suitable example. (Marks 15)
2018 MAY[1) Explain application of Operations Research in bus
ness and management. (Marks 5)
[7) Define Operations Rese: ch. Explain the scope and
cance of Operations Hesearch. Describe some methods of O.R. signitl
(Marks 15)
Operations Research
DPT Pbi-4
FROM PUNIABI UNIVERSITY

THEORETICAL PROBLEMS
2004 APR.[9](d) Define Feasible solution. (Marks 4)
Define feasible solution
in L.P.P. (Marks 4)
2004SEP/9](f)
2005 APR.[2] What is linear programming ? Explain the
of linear programming. (Marks 15)
assumptions and applications mathematical and economic struc
Formulate the
ture ofSEP[2]
2005 the Linear Programming Problem. What requirements
should be met in order that the linear programming may be ap.

plied ? (Marks 15)


9]6) Explain Non-negativity restrictions in linear programming
problem. (Marks 4)
Discuss the Linear programming problem.
2006 APR.9](i) (Marks 4)
is meant by Linear Programming Problem
2006 SEP.[2] What mathematical
(LPP)? What the
are requirements of LPP? Give a

formulation of General LPP. (Marks 15)


Define Linear Programming. What are its require-
2007APR.[3]
ments and assumptions ? (Marks 15)
[9](h) Write short note on Redundant constraints. (Marks 2)
[9J(k) Write short note on Feasible solution. (Marks 2)
2007 SEP9]) Write short note on Linear programming. (Marks 2)
[9g) Write short note on Unbounded problem. (Marks 2)
910) Write short note on Graphic method. (Marks 2)
2008APR.[3](a) Define feasible solution i L.P.P (Marks 5)
C]a short note on Redundant Constraints. (Marks 4)
2009APR9](Gi) Deline Infeasible solution. (Marks 4)
2009 SEP13](a) Explain the Graphic method of solving a L.P.P.
(Marks 5)
9]ii) Define Redundant constraints.
2010 APR.[9](iv) Write short note on Multiple opinmal solutions in
(Marks 4)
LPP (i Marks 4)
2010 SEP.[3] Describe the procedure for solving lineai orog-
ramming problem (LPP) througn tne graphic method. (Marks 15)
9]iv) Define Unbounded solution in LPP. (Marks 4)
2011 APR.[3] Explain the procedure ror solving Linear
prograrnming
problem (LPP) througn tne grapric metnod. What are the limitations
method ?
of graphic
(Marks 15)
126
Operations Research
DPT- Pbi-4
191(v) Write short note on
Unbounded solution in LPP. (Marks 4)
2011 SEP9J(v) Write a note on Feasible solution. (Marks 4)
2012 NOV.I1J(V) What are Non Negativity Restriction in Linear
Programming ?
(Marks 2)
191b) Explain the key steps involved in Graphical Solution of Linear
Programming Models.
(Marks 7h)
2013 NOV[1](v) What are mixed Constraints in Linear Prog-
ramming ?
(Marks 2)
91(6) Explain the key steps involved in Graphical Solution of Linear
Programming Models. (Marks 8)
2014 NOV.[1]() What are the types of problems that LPP can help
in solving ? (Marks 2)
7](a) What is Linear programming problem ? What are the
assumptions in formulating Linear programming problem ? What
are the major limitations? (Marks 7)
2015NOV.[8]{b) What is an LPP ? Give its major limitations.
(Marks 5)
an LPP. (Marks 3)
9Mg) Discuss graphical method of solving of
Write two limitations of graphic method solving an LPP
9J0) (Marks 3)
? What are
What is Linear programming problem
2017MAY[5] Linear programming problem. What
ne assumptions in formulating
(Marks 10)
arethemajor limitations ? (Marks 3)
910) Unbounded solution. (Marks 3)
I)Redundant constraints.
Chapter Linear Programming
3
(Simplex Method)
FROM PUNJAB UNIVERSITY
THEORETiCAL PROBLEMS
o008 APR(1] Explain
degeneracy in L.P. problems.
an12 SEP.[7] What is meant
Famming problem ? How is it by optimal solution of (Marks 5)
a linear p g
thatoptimal solution is reached.determined in the iteration process
2013APR.I7] What do the (Marks 15)
? co-efficients
represent Why is it necessary to within a
simplex table are
cients for each table in the compute a new set of
coeffi
analysis
2015 SEP(7]6) What is meant by key
?
(Marks 15)
column,
element? How are these identified in simplex key row and key
analysis? (Marks 10)

NOMERICAL PROBLEMS
2008 APR.[9] Solve the following problem by the simplex method:
Maximize Z =
4x, + 3x, +6x
Subject to s440
2x, +3x, +2x,
4x, +3x, s470
s430
2x, +
5x,
X,Xg X, 20. (Marks 15)

Ans.[ Z =
1066.67, x, =
0, x, = 42.22, X, =
156.67 ]
method, solve the following problem:
C0O8SEP[8] Using simplex
Maximize Z = 20x, + 10X
=150
Subject to x, +x,
x, S40

X 20 (Marks 15)
X Xg 0 .
1,900]
Ans. [ x, 40, = 110, Z =
=

X2
129
Operations Research DPT Pt
Solve using the Simplex method :
2009APR.[8]
Maximize z = 110x, + 60x, + 40x,
100
Subject too X, +X,+ X,
s 600
10x, + 4x, + 5x,
300
2x, +2x,+ 6x, s
XX X 20.
(Marks 1
Ans. [ z = 7666.67; x, = 33.33; x, 66.67; X, 0]

2009 SEPJ8] Solve using the simplex method


Minimize Z =5x,+ 6x
Subject to
-2x,+ 5x, 21500
3x,+X,21200
XX 20 (Marks 15
Ans. [x, = 264.71; x, = 405.88; Z = 3,758.83

2010APR[8] Solve using the Simplex method :


Max Z= x+2x,+3x,
S.t. x,-X+X,2 4
x, +X+2x, a 8
X-X2 2
whereas X, X2 X3 2 0. (Marks 15)
Ans.[ Z 54/5; x, 18/5; X,
= = =
6/5; X, =8/5]

2010 SEP.8] An Airforce is experimenting with three types of Bombs


P,Q,R in which three kinds of explosives, i.e., A, B, C will be used.
Taking various factors into consideration, it has been decided to
use the maximum 600 Kg explosive A, at least
480 Kg explosive B
and exacthly 540 Kg explosive C. Bomb P requires
3, 2, 2 Kg of A,
B&C respectively. Bomb Q
requires 1, 4, 3 Kg of A, B and C
respectively. Bomb R requires 4, 2,3 Kg of A, B & C respectively.
Romb P will give equivalent of 2 tons explosive, Bomb Q will give 3
tons explosive and Bomb R will give 4 tons
explosive. Under what
production schedule can the Air Force make the biggest bang ?

130
rations Research
DPT Pb1-4
Max. Z =
660; X, =0, X, 60,
Ans.

Max. Z = 2x,
=
x,= 120] (Marks 15)
Hint.
3x, + 4x,
Subject 3X, + X, + 4x, 600

2x, +4x, + 2x, 2 480


2x, +3x, + 3x, = 540

2011APR.(10] Solve the following L.P.P.


Min Z X,+ 2x+ 3x
=

Subject to = X,-X2t Xg24


X++ 2x s8
22

(Marks 15)
Ans.[ Z= 4; X, = 4; X2= 0;x, = 0

2011SEPI3] Solve the following LPP by Simplex method


Max Z =
100x,+ 40x
Sub. to.
40x, + 50x, s 900
3/2x, +2/3x, s 30
XqXg0. (Marks 5)
Ans. [ Z = 2,000; x, = 20; x = 0]

method
2012APR.I8] Solve by Simplex
Max Z 4x, + 5X2- 3X3
=

subject to =X, + X2+ X3= 10


x-X2 2 1

3X2 +Xg 30
2x, +
(Marks 15)
Ans. [x, = 11/2, x, = 9/2, x, = 0; Z = 89/2

012 SEP[10] Max Z = 2000x,+3000X


Subject to 6x, + 9x2 100 2x, +X2 20

Where x,, X220

131
Operaticns Research DPI Pb14
(a) Solve the above LPP
(b) is there any multiple optimal solution ? Prove.
Ans.[Z= 1,00,000/3; x, = 20/3; x, = 20/3 OR x, = O, X,= 10/9)

(Marks 105

2013 APR.[10) Max Z = 3x, + 2x, + X


=8
S.t.3x, + 2x, + 2x, +A, + 0A2 7
3X, + 4x, +X, + OA, Az
=
+

Whereas X,, X, X. A,, Az 2 0


(Marks 15,
Ans.[ Solution is unbounded
Method:
2013 SEP[8] Solve by Simplex
Max Z=2x,+3x,+4x3 600
Subject to : 3x, +X,+4x,
2480
2x,+ 4x, +2x,
540
2x, + 3x 3x,
=
+
(Marks 15)
0; x, = 60; X, =
120]
Ans. [Z =
660; X, =

APR.[8] Use Simplex solve


to
2014Max Z = 15x, + 25%2
Subject to
7x, +6x,2 20
30
8x, +5x, S
3x,-2x, = 1.8

where x,, X,2 0. (Marks 15)


Ans.[Z=94.3545, x, =2.2258, x, =2.4387]

2014 SEP/9] Use Simplex method


to maximize :
Max Z 3x, +5%, + 4X3 s8
Subject to : 2x, +3x2
2x+5x 10
15
3x, +2x, + 4x,
Where x,, X2 and x,2 0. (Marks 15)
Ans.[Z = 765/41; x,
=
89/41; X, =
50/41;x, =62/41]

132
Operations Research
o015APR3 Use Simplex DPT-Pb-4
Maximize Z 2x, +X,+Method to solve
subject to
X,+ Xt+ 2x,< x5
2x, + 3x,+ 4x,= 12
X X, X>0
Ans [ Max. Z= 8,
X, = 3, X,= 2, X, =0)
(Marks 15)

2015 SEP[8] Solve the


Max. Z =
4x, +3x,
following LPP by
simplex
Subject to :
X, +X2 s 50
X,+2x 80
3x, +2x, 2 140
Whereas X,, X2 2 0.
Ans.[ Solution is (Marks 15)
infeasible ]
2016APR.[8] Use Simplex to solve:
Maximize Z=2x, + xz +3xg
Subject to:X,+X2+ 2x5
2x, + 3x, +4x, = 12
where x,, Xg *32 0. (Marks 15)
Ans. [ Max. Z=8, x, = 3, x= 2, X, = 0]

2016 SEP8}Solve the following using simplex

Maximize: Z 4x,+ 3X2


X, +X2 5 0
Subject to
80
X, +
2x, 2
3x, + 2x, 2140 (Marks 15)
Where
Ans. [ Solution is infeasible ]

linear programming problem


by
Solve the following
017 MAY,[3]
Simplex method.

133
FROM PUNIABI UNIVERSITY
THEORETICAL PROBLEMS
2004APR.9](¢) Define Degeneracy in L.P.P (Marks 4)
decision in LP.P. (Marks 4)
2004SEP9(¢) Explain Key 2)
2007APR.[9]0) Write short note on Simplex method. (Marks
Unrestricted variables. (Marks 2)
916) Write short note on on Slack variables. (Marks 2)
2007 SEP.[9](h) Write short note variablesS. (Marks 2)
9]) Write short note on Surplus
Write short note on Simplex Method. (Marks 4)
2008 APR[9]() unrestricted variable.
Write short note on
2008 SEP./9](d) (Marks 4)
a Linear
the Simplex method of solving
2010APR.[3] Explain briefly Why the Simplex method is consider-
Programming Problem (LPP). ?
(Marks 15)
method
ed superior to Graphic
Degeneracy of LPP.
Write short note on (Marks 4)
2011 APR.[9J(ii)
suitable
method with the help of a
Describe Simplex (Marks 15)
2011 SEP 3] in
example. between degeneracy
difference
What is the problem ?
Z014 NOV[1](h) in Transportation
degeneracy
oimplex problem and (Marks 2)
of a problem by
in the solution
What are the various steps (Marks 7)
a)
Simplex method ?

135
Chapter Linear Programming
4
(Duality)
FROM PUNIAB UNIVERSITY
THEORETICALPROBLEMS
2008 APR.2]Explain the rules for converting a primal LP. problem
L.P. problem. (Marks 5)
into a dual
2009APR.|2] Explain Primal Dual relationship. (Marks 5)
(Marks 5)
2009 SEP2] Explain duality in L.P.P Dual Problem. Give impor-
Define Primal Problem and
2010 SEP2] (Marks 5)
tance of Duality Theorem of LP.P.
Ilustrate-Dual of the Dual is primal itself
2011 APR.(7](6) (Marks 5)
PRIMAL Problem
Discuss the rules for conversioni of a
2013SEP[3] conversion.
into its DUAL. Ilustrate
advantages of such
(Marks 5)

NUMERICAL PROBLEMS
problem
Construct the dual of the following
2008APR[5]
Maximize Z =. 3x, 10x, + 2*,
+
7
Subject to 2x,+3x, + 2x,
3
4x,
=
+
3x,- 2x, Marks 5)
0.
X, Xa X 2
Minimize Z =
7y, +3Y
Ans. [ 2y,+3y, 2 3
Subject to 10
2
3y, 2y,
2y, +4y, 22
u n r e s t r i c t e d
in sign )
is
y,20, Y
form a
factors x
andy to
combines
of x and not
ABC
company
At least
20 Kg.
and y
<010APR.[9] weight
50 Kg.
costs Hs. 25 per Kg.
Product
which must used. x
can be
Ore than 40 Kg of y
139
Operations Research DPT-Pbr-4
costs Hs. 10 per Kg. Use the Dual method to find the aout o
Tactor x and y which should be used for manufacturing
cerned product. (Marks 15)
Ans.[ Z = Rs. 800; x = 20; y = 30
Hint.[ Min. Z = 25x + 10y
Subject: x+y= 50
X 2 20
ys 40
X,Y 20
Problem
LP.
following
the
2 Write the DUAL of
Min2 = X-3x-2,
S-7
Subject to = 3x-x,+ 2x,
12
2X-42 =10
4x,+ 3x+ 8x, in sign.
(Marks 5)
Unrestricted

0, x,
x, x,2
Maximum Z =
7y, + 12y, + 10y
Ans. [ S 1
Subject to 3y, +2y + 4y,
Y-4y,+3y, S-3

2y,-8y2
unrestricted in sign ]1
Y,20; , is
Y
the following problem:
Write the DUAL of
2011 SEP/9]
Min Z= X,-3x,-2x,
3x,-x,+2x,S -7
Sub. to
2x,-4x 2 12
10
4x,+ 3x,+ 8x,
=

unrestricted in sign. (Marks 15)


Where x,, X2 0, X,
Ans. [ Maximum Z = 7y, + 12y, + 10y,
Subject to +2+ 4y, S1
-3y,
Y-4Y,+3y, S-3
-2y, +8y, =-2

y Y20; y, is unrestricted in sign]

2012APR.3] Write the DUAL of:


140
OpNraions Research
Min DPT-Pbi-4
2= 25x, +
10x,
subject t0 =

X, +
50
X, =

K, 20
40
Xq, X, 0.
Ans. [ Maximum Z = (Marks 5)
Subject to 50y+20y,- 40y,
Y +y, s 25
y-Y, s 10
Ya Y20; y is unrestricted in sign]
2013 APR.[3] Write the Primal of the
Mini Z following Dual:
10y, +8y2
s.t.
Y+2y25
2y,-Y212
Y,+3y24
Y,20, y2 unrestricted in sign. (Marks 5)
Ans. [ Maximize Z 5x, + 12x, +4x=

Subject to X, +2x, +X, s 10


2x,-X + 3x, = 8
X XgX2 0

2013SEP 9] Write the DUAL of the folowing problem


Max Z 6x, +8x
Subject to : 2x, + 3x2 s 16
16
4x, +2x 2

16
2x, +X =

X,, X2 2O. (Marks 15)


16y, - 16y, + 16y,
Ans. [ Min. Z =
6
Subject to 2y,-4y, +2y, 2
3y,-2y+Y, 28

Y220, Ys IS unrestricted in sign ]


Y
LPP:
Obtain the dual of following
2014 APR.[3]
141
Operations Research DPT-Pb-4
Maximize Z 3x, =
+
5x, + 7x,
Subject to
X,+X + 3x, s 10

4X, X, 2x, +
2
15
XX0, X, is unrestricted in sign
(Marks 5)
Ans.[ Min. Z = 10y, - 15y,

Subject to y,-4y,23
Y,+y,&55
3y,-2y, =7
Y y 20]
below
the L.P.P. given
2014SEP4] Obtain the dual of
Max Z = 2x, + 5x, + 10x
Subject to: x, -Xg S8
4x, +8x S 20
s 2
X+Xgt 2x
6x,+4X-2x, = 10
(Marks 5)
Where x,, X2, Xg2 0
Ans.[ Min. Z =
8y, + 20y, +2, + 1Oy$
Subject to constraints
Y,+4y+Ys +6y, 22
25
By +Yg +4y,
V, +2y,-2y,2 10
whereas y y» Y,20; Y, is unrestricted in sign]

LP. Problem
2015 APR41 Obtain the dual of the following
Maxu2e Z= 2x, +3x, +X3
to 4x, +3x2 +X, = 6
subject
X, +2x + 5x, = 4
(Marks 5)
XXa Xg0.
Ans.[ Min. Z = 6y, + 4y,

Subject io: 4y, +Y,22


3y,+2y,2 3
Y, +5y, 1

Y y2 are unrestricted in sign

142
Operations Research DPT-Pbi-4

2015 SEP[6) Obtain the dual of the following LPP


Min. Z x,+X, t Xg
Subject to
X,-3x, 4x, = 5 +

X,-2x,23
2x2Xg >4
X, Xg> 0, x, is unrestricted in
sign. (Marks 5)
Ans.[ Max. Z =
-5y, +3y, + 4y,
Subject to constraints:
Y+y 1

-3y-2y,+2y, s 1
-4Y YS1
4Y+YS-1
whereas y Y20, y is unrestricted in sign ]

2016APR.[3] Obtain the dual of the following LP.P.


Maximize Z= 2x, +3Xka +X3
subject to: 4x, +3x2 + Xg = 6

x +2x + 5x, = 4
X,Xa g20. (Marks 5)
Ans. [ Min. Z =
6y, +4y2
Subject to:
4y,+y,2 2
3y, +2y,2 3
Y+5Y, 11
are unrestricted in sign ]
Y1 Y2

2016SEP[3] Obtain dual of the following LPP


Maximize:
Z 3x, + 5x, + 7%3
Subject to:
X, +X2 +
3x, s 10

4x,-X + 2x, 2 15
where x, X, 20, X, is unrestricted in sign. (Marks 5)

143
Operations Research DPT Pbi-4
Ans. [ Min. Z 10y,
= -

15y,
Subject to y,-4y,3
y,+y25
3y,-2y, = 7

Y. Y,20]
following LP
2017 MAY[1]6i) Write the dual of the
Min z 4x, + 5Mg

2x, -x + 4x, 3
2x-527 (Marks 5)
Ans.[ Max z = -3y, + 7Y2
Subject to
-2y, 0
y, +2y 4

4y,-5y2 s5
where as , Y2 20

Obtain the dual of following LPP


2018MAY[5]
Maximize Z = 3x, + 5x, + 7x
subject to x, +*2+3x, 10
4x,-X+ 2xg2 15

X,X20, X is unrestricted in sign. (Marks 5)


Ans. [ Min. Z= 10y, - 15y

Subject to y, ,23
Y,+y255
3y,-2, =7

Y y,20

FROMPUNIABI UNIVERSITY
THEORETICAL PROBLEMS
2004 SEP9](a) Define dual of a primal. (Marks 4)
2007 SEP3] What do you mean by Duality ? What areis
characteristics and advantages ? (Marks 15)
144
Operations Research DPT- Pbi-4

2010 APRI9J(V) Explain


into Dual.
general rules tor converting the Prima
(Marks 4)
2010 SEPI9J(V) Define 'Duality' in linear
(Marks
2011 APRI9JV) Explain general rules forprogramming.
conveting the Prima
into Dua (Marks 4)
2012NOV Define Primal and Dual of an L.P.P. (Marks 2)
2013 NOV.[1](x) Define Duality. (Marks 2)
2014 NOV|8J(a) What are the
characteristics of Dual problem and
what are its advantages ?
(Marks 7)

NGMERICAL PROBLEMS
2007 APR.4] Obtain the dual of
Maximise Z= 45x, +80x,
Subject to 5x, +20x, s 400
10x, + 15x, s 450
Xq, Xz 2 O. (Marks 15)
Ans.[ Min. Z = 400y, + 450y2
Subject to 5y, +10y22 45
20y, +15y,280
YY220.

2014NOV[1(g) Find the dual of the following problem


Max. Z =
12x, + 15x, +9x
Subject to constraints
8x, +16x, + 12x, s 25
4x, +8x, +10x, 2 80
7x, 9x, +8x, 105
=
+

(Marks 2)
X,XX 20.
Ans. [ Min. Z = 25y, - 80y, 105y
Subject to constraints
12
8y,-4y, -7Y, 2 15
16y,-8y, 9y, 2
-

2 9
12y, 10y, 8y, is
-

and y,
unrestricted in sign ]
Y Y20
145
Chapte
5
Transportation Problems
FROM PUNGB UNIVERSITY
NUMERICAL PROBLEMS
2008 APR.[10] Solve the following transportation problem in which
the cell values represent unit
transportation cost in rupees
Destinations
2 3 4 Availability
A 2 5 5 30
B 4 4 5 15
Origins 5 3 3 2 10
D 4 -1 4 2 20
Requirement 20 25 15 15
Ans.[A-1: Rs. 35, A - 2: Rs. 10,A-3: Rs. 75, A-4:Rs. 25, B-1
Rs. 60; C-4: Rs. 20; D 2: Rs. -20; Total minimum cost =
Rs. 2051 (Marks 15)
2008 SEP/9] Solve the following transportation problem
To
2 3 4 Supply
A 3 8 60
B 5 10 100
From
C 2 6 5 1 40
Demand 50
20 50 80
B- 2 60, B -3 250,
60, A 4 =240, B- 1 80,
=
=
Ans. [A -

2 -

(Marks 15)
40; Total min. cost 730]
=
C-4

has distribution centres


009 APR.[9] A manufacturing company
20 and 40 uits of product. Its
and z. These centres have 40,
Ay 25, 10, 20, 30 and 15
outlets at A, B, C, D and E requires
Clall between
cost (Rupees in Unit)
S respectively. The transport
outlet is given in the foilowing table
n centre and each

147
Operations Research DPT
D E
Pbi4
B C
55 30 40 50 40
35 30 100 45 60
40 60 95 35 30

Find out the optimum distribution cost. (Marks 15


Ans. [x-B: Rs. 300: x-C: Rs. 800; x-E: Rs. 400, y-A: Rs. 700,2
A: Rs. 200; z-D: Rs. 1,050; z-E: Rs. 150; Optimum Cost
Rs. 3,600]

2009SEP9] Company is spending Rs. 1,000 on transportation


its units from three plants to four distribution centres. The supply
and demand of units, with cos: of transportation are given as
Distribution Centres Availability
D, D50 D
19 30 12
Plant 70 30 40 60 0
Pa 4 60 20 18
Requirements 5 7 15
What can be minimize saving by optimum scheduling ?
Ans. [ P,-D,:95; P,-D.,:24; P,-D,:90; P,-D,:280; P,-D,:50
Pa D,:260,; Total min. cost Rs. 799; Saving = Rs. 201]
(Marks 15)
2010 APR.[10] Using the Stenping Stone method, solve the follow
ing transportation problem (costs in RS. for minimuin cost of
transportation
Factory Depot Capacity
D E G
A 4
6 700
B 3 5 5 400
3 9 5 600
Required 400 450 350 500 1700
Ans. [A E: Rs. 2,700; A
G: Rs. 1,500; B- D:
- Rs. 150; B- F: Rs.
700; C -
D: Rs. 1,050; C G: Rs.
1,250; Total min. cost
-

Rs. 7,350 ]1 (Marks 15)

2010 SEP.[10] Natiornal On company has three refineries and fou


Denots. Transportation costs per ton and requirements are given
below
148
OperalionsS K e s e a r c h
DPT- Pbi-4

DEPOTS
R E F I N E R I E S
D, D, CAPACITY
5 7
P 13 10 700
8 14
P2 13 400
12 10 9 11 800
P3
REQUIREMENT 300 600 700 400
Determine optimal allocation of output. (Marks 15)
Ans.
(P,- D,= 1,500; P, D, =1,400; P, -

D, 2,000; P, D,
=
- =

2,400; P D
-
=
6,300; P D, =1,100: Total min. cost =

14,700 ]
for
2011 APR.[8] Solve the following transportation problem
maximum profit
Per UnitProfit(Rs.)
MARKETS
A B C D
12 18 6 25
WARE-HOUSES 8 10 18
14 3 11 20

Availability at
warehouses X : 200 Units
Y: 500 Units
Z 300 Units
A: 180 Units C 100 Units
Demand in Markets: D: 400 Units.
B: 320 Units
Y D: 5,040; Z A:
B: 840; Y C: 1,000;
-

B: 3,600; Y
-

Ans. [X -

Max. Profit = Rs.


15,400
2,520; Z
-

D: 2,400; Total (Marks 15)


approxi-
reasible solution by Vogel's
Determine Initial
011 SEP5]
mation method Mills M, Supply
M M
M 6 8
4 5 2
5
4 14
Furnances F 4
7 8
6
4 20;
F- M,
=

Demand 4 F. M, =8;
=8;
-

M, (Marks 5)
=8;F,
-

Ans. M,= 16; F, M,


* Total min.
cost = 84
]|
3M
=
24;
149
Operations hesearch DPT Pb1-4

2012APR.9J Solve the trar.sportation problem to maximise prons


and give criterion for opimality
DEPOTS IV CAPACITY
WAREHOUSES
33 100
40 5 22
30 30
B 44 35 30 70
38
38 28 30
60
30
REQUIREMENT 40 20 : 760,
: 880, B
-

ll: 300, C-
Ans. I
A !: 800; A- IV: 990: B
-

(Marks 15)
C-I1: 1,400; Profit = 5,130
B andC
three plants at location A,
company has
U1Z SEP[8] A at D, E, F, G and H. Monthly
warehouses located
which supply to 900 units respectively.
Monthly ware
capacity are 800, 500, and 800 units
plant 400, 500, 400
houses requirement are 400, below
(in Rs.) are given
transportation cost
respectively. Unit
G
From/To D
3
6
A
6
76
8
the company in order
Determine the optimum distribution for
the total transportation cost.
(Marks 15)
to minimize
Rs. 600; C-E: Rs.
Ans. [A-H: Rs. 2,400; B-D : Rs. 1,600; B-G:
1,600; C-F: Rs. 1,200; C-G: Rs. 1,800; Dummy-F :0;
Total Min. Cost Rs. 9,200)

2013APR.8] Solve the following transportation problem


To D D D D Available
From
4 3 1 80
3 4 60
S 3 40
Requirement 50 60 20 50 180
Ans. [S, D,=40; S,-D, =20;S, -D,= 100; S,-D, = 120; S,-D,
120; Total cost 400 ]1 (Marks 15)
2013 SEP[10] A company has four factories manufacturing the
same product. Production cost and raw material cost differ from
150
Operations Research DPT- Pbi-4
ry to tactory. The transportation cost differs from factories
factory
Sales Depots ots. Determine the most production and

ribution schedule and the profitable


distrit
corresponding profit.
Sale Require
F Fa F F price ment
unit

Production cosUUnit 15 18 14
Raw Material cost/Unit 10 9
3 9
12
5 34 80
Transportation
cost per Unit 32 120
5 3 31 150

Production capacityy 10 150 50 100

Ans.[F S 60; F Sa-180; F - S,: -240; FS,: 100; F


S,:640; Fa- S2: 100; Profit =480 1 (Marks 15)

2014 APR.[6] Consider a transportation problem with m =3 andn


= 4 where
C =2, C2 3 , C1311, C47
C211, C220, C2 6, C241
C31 Caa8, C33 15, Ca 9
6, S, 1, S, 10 and D, =7, D, 5, D, 3 and
Suppose S, = = = = =

D= 2. Apply transportation method to find an optimal solution.


Ans.[S, D,= 15;S,- D,= 11;S,-D, =6; S,- D, =35;3, D, =15;
-

S- D= 18; Total Min. 1C0] (Marks 5)


=

Determine the optimum basic feasible solution to


2015 APR.[9]
the following transportation problem
A B Available
50 30 220
90 45 170
From
II| 250 200 50 4
2 2 (Marks 15)
Required 4
270; Ill- B 400; II1- C =
100; Total Min.
[i-A =50; 1 - A=
=
Ans.
= 8201

151
FROM PUNJABI UNIVERSITY
THEORSTICAL PROBLEMS
2004SEP9(g) Define VAM method in Transportation in L.P.P.
9]) Define optimum solution.
(Marks 4)
(Marks 4)
2005 APR9(6)Methods used for minunizing the transportation
cost.
(Marks 4)
2005 SEP[9](d) Explain Formulation of transportation problems.
(Marks 4)
2006 SEP 9](c) Explain with suitable examples the meaning of
Transportation problem. (Marks 4)
2008 APR.[4](a) Explain the difference between transportation
problem and an assignment problem. (Marks 5)
2009 APR4](a) Explain the difference between Transportation
pioblem and an Assignment problem. (Marks 3)
9Niv) Define Unbalanced transportation problem. (Marks 4)
2009 SEP.4](a) Describe the MODI method of testing the optimality
of solution of a transportation problem. (Marks 5)
2010SEP/9]Vi) What is a Transportation Problem ? (Marks 4)
2012 NOV.[1]6i) Explain the meaning of an Uhbalanced Trans
portation Problem. (Marks 2)
2013NOV 1]6ix) What is Degeneracy in Transportation Problems?
Marks 2)
2014 NOV.I1J(h) What is the difference between degeneracy in
Simplex problem and degeneracy in Transportation problem ?
(Marks 2)
2015NOV9](a) Differentiate between Assignment Problem and
Transportation Problem. (Marks 3)
153
Chapter Assignment Problems

6
FROMPUNIAB UNIVERSITY

NUMERICALPROBLEMS salesmen and


has four
product made. The
A firm marketing is to be
2012APR.4] whom a sale of
each unit salesman can

tnree customers
to each of the
with which
probability
aata depicts the
customers
sell to each of the
SALESMAN
SA
0.5 0.8
C 0.7 0.4
0.6 0.7
0.5 0.8
CUSTOMER 0.6 0.2
0.3 0.9
to each of the customer,
Salesman is to be assigned The
If cnly one Salesman-Customer
shall be optimal?
of is Rs. 450
what
combination

one unit to C, is Rs. 500, to C,


obtained by seling ? (Marks 5)
profits What is the expected profit
is Rs. 540.
and to C Rs. 1,156]1
Ans.[C,S, C,S, C+S,
Profit =
different products,
viz. A, B,
producing four
(10] An organisation viz. P, a, R, S are capable of
four operators,
C, D and having effectively working 7 hours
a
of the four products
producing any for producing
each operztor
The time in minutes required for
day.
are given in the matrix along with the profit
each product
of the
(Rs. per unit):
PRODUCTS
B C D
OPERATOR
10 14 12
P
3 4
Q
7 10 10
R
10 15 15
S 20
2 4 1
PROFIT 3
(Rs. per unit )
158
nerations Research DPT-Pbi-4

OPetermine the assignment of operators to products to maxi


Det
mise t h e p r o f i t s
(Marks 15)

Ans.I P>A, aC,R >B, SD]


AnsMax. Profit (one day) = Rs. 960]
Hint.[Max.

Traveling salesman has to visit 5 cities. He wishes to


SEP.41 tO
and then return
2from a particular city, visit each city once

point. COSt of going from one city to another is shown


starting
st
You are require to ind the least cost route.
below.

To City
A B C D E
4 10 14 2

B 12 10
8 4
From City C 16 14
8 2 10
D 24
6 4 16
2 (Marks 5)
A-B>C>D>E>A;
Min. Cost 30]
Ans. [ in the
The data given
assignment problem.
9 Solve the following
units.
production in
table refer to
Machine
B C D
Operations
10 10
11
9
8
5 5
5 (Marks 15)
9 7
5 8 Production
= 38 units ]
Max.
3-C, 5--8;
Ans. [ 1A, 2->D, problem given by the
salesman
Solve the following
2013 APR.4] 10, C3, =

6
following data 5, Cq4 = 6, C2s =

220, Ca =
4, C, = 10, Cz
45 20. cities i andj ifa
no route
vetween (Marks 5)
is
Valnere C C, and there
value of C is not known. = 49]
Min.
Ans. [ 5231,
rate basis
for
piece
on hOurly
typists and their charges
9 A solicitor firm employs for
service

Iheir aily or
work. There are
five typists
159

You might also like