NOVEMBERDECEMBER 2021

BSMA33/USMA43- LINEAR
PROGRAMMING

Time Three hours Maximum: 75 marks

SECTIONA-(10x 2= 20 marks)

Answer ALL the questions.

1.
1. Define unbounded solution.

abuppBta avogup.
2. Write the standard form of the LPP.

3 Write the condition for Degenerate Solution in

Transportation problem.

Write the mathematical formulation of the

4.
Transportation Problem.

Define an Assignment Problem.

5.

759
t. How do you convert an unbalanced Assignment
Problem to a balanced Assignment Problem?
6L0BmeoudD
6LDBmuTs oTHaTi?

Define saddle point in a game.

Define two person zero sum game.

lnaTUmL
What is meant by simulation?

10 Write any two applications of simulation.

ST(L955. UwTUTGl&maT

SECTION B-(5 x 5 =
25 marks)
Answer ALL questions.
1 (a)
(a) Solve the followinag LPP by graphical
method.
Maximize Z =
3x, + 4x
Subject to the constraints:
2x +5, S120
4x + 2x, 8 0
, 20

2 759
 anu pmpamuJU uudruOAS bipehsoar

suaug&G Z = 3x, + 4x

sLUuQsd
2, +5x, S 120
4x+2x S 80

Or
(b) Construct the dual to the primal problem
Maximize Z =
ar +17r, +91
Subject to the constraints :

-X2 +X3 23
-3x +2, S1
1,2, * 20

6iQunisnsG Z =3x, +17s +9x3

6LQUun%T
2 t * 23
-3x +2x, S1
X1,X2, X3 20

12. (a) Explain North-West Corner Rule.

aGops pmo ailau aflaflss.

Or
3 759
Find initial basic feasible solution to the
.
lollowing transportation problem by Matrix
Minima Method.
Di D2 D3 D4 Supply
250
S 1 13 17 14

S2 16 18 14 10 300

S3 21 24 13 10 400

Demand 200 225 275 250

D2 D3 D4 9gUy
Di

11 13 17 14 250
S1
10 300
$2 16 18 14

24 13 10 400
$3 21

200 225 275 250

gaa

Problem.
)
Solve thefollowing Assignment
E F GH

18 26 17 }1
A

13 28 14 26
B
38 19 18 l5
C

19 26 24 10
D

4
759
 E F G H
18 26 17 111
A
13 28 14 26
B

C 38 19 18 16

19 26 24 10
D

Or
the
that minimizes
(b)
(b) ind the assignment
total man-hours for the
following

AB C

I 9 26 15
II 13 27 6
III 35 20 15
IV 18 30 20

&psng chlayaG6G

A B C

I 9 26 15
II 13 27 6
III 35 20 15

IV 18 30 20

5 759
14 Using dominance property, solve the
14. (a)
following game:
Player B
B1 B2 B3
Player A Al(10 5-2)
A2 13 12 15
A3 16 14 10

aslanerunQut B
B1 B2 B3
salnun@uuit A Al 10 5 -2
A2 13 12 15
A3 16 14
10
Or
(b) in a game of matching coins, player A wins
Rs.2 if there are two heads, wins
nothing if
there are two tails and loses Re.l when there
are one head and one tail. Determine the
payoff matrix, best strategies for each player
and the value of the
game to A.
GunGbgd p1Tuisaicr ailnarumLq.cb, aigr
A goi . 2

(LbGurgi . 18 e68pnt. gádan5

pps
ablca arunicm ncuou A &6
Stonalasatb.
6
759
15. (a) Explain the steps involved in Monte Carlo
Simulation.
LDTILntGar a-asÜuOApclc BenasT

Or
(b) Describe the additive type of congruence in

random number generation.

amssaDeT Slaflss.

SECTIONC-(3x 10 80 marks)

Answer any THREE questions.

16. Use Simplex method to solve the LPP.

Maximize Z =r +õx
Subject to the constraints
3x, +2x s18

0sxs4
0SrS6
Abuanso qpopamuu uuuuGsS Er.
6LQungráG Z =8 + öx,
sGUuGscr
3x +2x S 18

0s 4
0 r 36

1 759
17 Solve the
following Transportation Problem.
W1 W2 w3 W Supply
F1 5 3 8 300
F2 4 6 9 5 500
F3 2 6 4 5 200

Demand 200 300 400 100

W w2 w3 W Dgùy
F1 5 73 8 300

F2 6 9 5 500

F3 2 6 4 200

560 200 300 400 100

Find the optimum solution to the following

the maximum
Asignment Problem which gives
piofit
A B C D E

32 38 40 28 40

I1 40 24 28 21 36

41 27 33 30 37
III
IV 22 38 41 36 36

29 33 40 35 39

759
 &ip&sngod BUL6D

ABC D E

I32 38 40 28 40

II 40 24 28 21 36

III 41 27 33 30 37

IV 22 38 41 36 36

V 29 33 40 35 39

19. Solve the following game graphically:

Player B

B1 B2 B3 B4

Player A Al2 1 0 -2

A2 o 3 2

aflcnerTGuat B

B1 B2 B3 B4

AacrurQuait A A1 2 1 0 -2

A2 03 2
9 759
20.
20. A manufacturing company keeps stock of a special
product. Previous experience indicate the daily
demand as given below. Consider the following
sequence of random numbers : 48, 78, 51, 56, 77,
15, 14, 68 and 09. Simulate the demand for the
next 10 days.
Daily demand: 0 15 25 35 45 55

Probability 0.01 0.15 0.20 0.50 0.12 0.02

lsTssiuLQererui4 orsfi Gsmaimu GHl&spgi.

Erdp srensafiest ica(gto almsmu 48, 78, 51, 56,
77. 15, 14, 68 opgid 09 uuTuG$. 0 $ s 10

Daily demand 0 15 25 35 45 55
Probability: 0.01 0.15 0.20 0.50 0.12 0.02

10 759