No.

of Printed Pages : 12

MTE-12

BACHELOR'S DEGREE PROGRAMME(BDP)

Term-End Examination
June, 2014

r:1
ni E:

ELECTIVE COURSE : MATHEMATICS

MTE-1 2 : LINEAR PROGRAMMING

Time : 2 hours

Maximum Marks : 50
(Weightage : 70%)

Note : Question no. 1 is compulsory. Do any four

questions out of question nos. 2 to 7. Calculators
are not allowed.
1.

State which of the following statements are true

and which are false. Give reasons for your
answer with a short proof or counter example. 5x2=10
(a)

A constraint in an LP problem restricts the

use of available resource.

(b) When maximin value of the game is less

than or equal to minimax values of the
game, then saddle point exists.
(c)

The solution to a transportation problem

with m-rows (supplies) and n-columns
(destinations) is feasible if number of
positive allocations are m + n.

(d) S = f(x, y) : 2x + y 4 or x + 2y 41 is a
convex set.
(e)
MTE-12

If the dual LPP is unbounded, then the

primal LPP is bounded.
1

P.T.O.

2.

(a) A dairy firm has three plants located in a

state. The daily milk production at each
plant is as follows :
Plant 1 : 6 thousand litres
Plant 2 : 1 thousand litres
Plant 3 : 10 thousand litres
Each day, the firm must fulfil the needs of
its four distribution centres. Minimum
requirement at each centre is as follows :
Distribution centre 1 : 7 thousand litres
Distribution centre 2 : 5 thousand litres
Distribution centre 3 : 3 thousand litres
Distribution centre 4 : 2 thousand litres
Cost in hundreds of rupees of shipping one
thousand litres from each plant to each
distribution centre is given in the following
table :
Distribution Centre
D4
D3
D2
D1
Plant

P1

11

P2
P3

15

Find initial basic feasible solution for the

given problem by using North-West corner
method, and Matrix-Minima method. Which
of the two solutions is better ? Justify your
answer.
MTE-12

(b) Obtain the dual problem of the following

primal LP problem :
Minimize z = x1 3x2 2x3
subject to

3x1 x2 + 2x3 7
2x1 4x2 12
4x1 + 3x2 + 8x3 = 10

xl, x2 > 0, x3 unrestricted in sign.

Your dual should have only three variables.

3. (a) Use the simplex method to solve the

following LP problem :

Maximize z = 3x1 + 5x2 + 4x3

subject to

2x1 + 3x2 5_ 8
2x2 + 5x3 10
3x1 + 2x2 + 4x3 5 15
x1, x2, x3 0.

(b) Use graphical method to solve the following

game :

Player B
B1

B2

B3

Al

A2

Player A

MTE-12

P.T.O.

4. (a) Using the principle of dominance, solve the

game whose pay-off matrix is given below :

Player B

Player A

B1

B2

B3

B4

Al

A2

A3

A4

(b) Without sketching the region, check whether

P (0, 0) is in the convex hull of the points
A ( 1, 1), B (1, 0) and C (0, 1). If it is in the
region, write P as convex combination of
A, B and C.

5. (a) Use the graphical method to solve the

following LP problem :
Maximize z = 2x1 + 3x2
subject to

x1 + x2 5 30
x2 3
0 x2 12
0 x1 20
x1 x2 - 0

MTE-12

(b) Solve the following cost minimization

assignment problem :

Machine

A
B
C
D
E

Job
R

85
90
75
80
76

75
78
66
72
64

65
66
57
60
56

125
132
114
120
112

75
78
69
72

68

6. (a) A businessman has to get 5 cabinets,

12 desks and 18 shelves cleaned. He has
two part-time employees, Anjali and Arnay.
Anjali can clean 1 cabinet, 3 desks and
3 shelves in a day, while Arnav can clean
1 cabinet, 2 desks and 3 shelves in a day.
Arnav is paid 22 per day and Anjali is
paid 25 per day. Formulate the problem
of finding the number of days for which
Anjali and Arnav have to be employed to
get the cleaning done with minimum cost as
a linear programming problem.
(b) For the following pay-off matrix, transform
the zero-sum game into an equivalent linear
programming problem :
Player B
B1
B2
B3
Al
Player A

MTE-12

A2
A3

1
3
6
5

1
5
2

3
3
2

7.

(a) Solve the following LP problem by using

two-phase simplex method :
Minimize

z = x1 2x2 3x3

subject to

2x1 + 3x2 + 3x3 = 2

2x1 + 3x2 + 4x3 = 1
x1, x2, x3 0.

(b) The initial basic feasible solution of a

transportation problem is given below :

F1

W2
W1
20
16
180
14

8
(ID

F2
26

24

F3
Demand

180

120

W3

Supply

12
0

200

18
0

160

16
0

90

150

450

Check whether the given solution is optimal.

If it is not, then find the optimal solution.

MTE-12

Tr.t.t.-12
timer) "am* chitistoi (41.t.111.)
VT

1, 2014
trfilFW
AftiW M 91411

3T 7
c aiw :50
(g)e1 7: 70%)

FITIT :2 tiel2
W:

T. 1 0(11 NAM,. 1 3R7 Ft. 2 4 7

eh i
WTT 914V clOq- I 47(1,25c.-?ej ITT gadv 954 137*
-#ffr */

2191 4 4 cf,
RRirt
3T t 0-1-4 areRi 133 .37it 1Tifwg ztrcr% zrr
mriqwul gim
trN7 I
5x2=10
LP TrgiTzrr ' r-44u, -wow *RR
NR-siNd chtlt t

1. War-47

NO

Pi-iRsi

74 i*Ift

RR,

aTe:riTrrsic Trfq
tr- rrtir fib
t
(Tr) m-tikaff (3TrE0)

qticit

t, a)-

4c1

(Jidoti) (4141

tfit4F TrITRT
-1411
tTR-ror
aTr-E-4 -t. *WI 1:11 n I
(IT) S = f(x, y) : 2x + y 4 711. x + 2y 4YRW
ktmclei t
(3:)

.1411

MTE-12

tet LPP 3irrit-44 t, c

I
7

3111 LPP tif(44

P.T.O.

ti rei 4 -erg

2. ()

cbli(gi4 - 3rreq9- TT 'wt

(gct

cra(gHt 1: 6

lk

2:1

II'k

ChR(.511.11

1R

cblt(.11-ii 3 : 10

Act r-i,

&1 tr
th-4 3TEr4 .qrT -1WdTErr *--

t I 3f*
is
aTr-gFr-*
---dr PIHRIRsid :

31m7w-dr

%TM- 44, 1 : 7

cwt

fd-dTtif

2:5

Cndt

framT

3:3

#IZT

fdffTur

4:2

wklar4 4 1

IR

4.1

rfla TT

\IA tt cPiid (A koiel) 4)

fdalvf 4.1 TIT

t Trzit :

PHRikskr

14-ffk-zrr

-wrTETT4

.37R-trr
7414

D1

D2

D3

D4

P1

11

P2

P3

15

14R

kg letT

741 Tri:R=4-r

srr(P
-4-* am-rfr

*117R I

A.

.3710 ? 3

cbitui trA-RI
MTE-12

Ta.
39

() PH rt
aTru LP Tiirtzrr tt a TP:R:Err
-MffR :
z = xl 3x2 2x3
A.N7
41.14

3x1 x2 + 2x3 5 7
2x1 - 4x2 12
- 4x1 + 3x2 + 8x3 = 10
x 1/ x2 > 0/ x3

aTeffeval

air* TTI. ETA A TA c 1 fl a41

RI

4aci -et9-

t.4
3.

() A4-iRiksict LP TFR;Erf
T*-ti-f 1WRI
AfA
z = 3x1 + 5x2 + 4x3 i1a aifiw A147

161

2X1

3X2

2x2 + 5x3

8
10

3x1 + 2x2 + 4x3

15

xl, x2, x3 0
(TO mitAti:RRT
Ati* :

cbk4, PHrciR d
4
Mt' B

R3faTt A

MTE-12

A
l
A2

B1

B2

B3

B4

-2

P.T.O.

4. () -5FlpfaT fEE4R. ITT -51z4TT cr>4.)

117

trP-4 :

( c1

aTfRO

-11,4

ftWOTt B

R3IFTt A

4-q

B1

B2

B3

B4

Al

A2
A3

A4

turP4-q *IR RH'

4z11

P (0, 0), -F43-11 A ( 1, 1), B (1, 0) atIT

C (o, 1)* 3Ta-gu kplia*ct,

t, c P A, B31 C
-r-JRR

5. ()

319U

art-4-MT

-4-.111(Id LP err

*rr-A7 :
z 2x1 + 3x2
va

47
3TRT+741A1C

x1+ x2< 30
3

x2

x1 20
x1
2
x>0
MTE-12

10

zA
1' .1

(g) P14.-&-asid 7,Effq tsimi f171T4

err A4
5

-1

6. ()

A
B
C
D
E

85
90
75
80
76

75
78
66
72
64

771f4
R
65
66
57
60
56

S
125
132
114
120
112

T
75
78
69
72
68

i of i'i iL14 5 *fAZ, 12 %5 aIN 18 /1F5

I ,s(14.) tIRT 't ch4'iiO
Wc4T-41
At
at( 3R-4-4 t Iai44r 'cr" iqq
1 Wiz, 3 t- E53 3 Ac..-t)
t 7-4ft 3TF-4 14-4 A 1Az, 2 ,k-w) at(
t I
3r{-44 att
3 Ac,44) TETT
25 Sfikk4 tffT
22 31N
stARI:
3f7-4t
-eticii4lchkut
t I TP:51 * twci
rqi -ri4 ut
4 3R-44 att
1R.g.t> -sh.gPF
(-1,11.11 q-rPKR, 1 1R:Err
rr 4 -el--d*C-4R

rii-ifZiRgi Trdn- alTR7

34-argrq
vi

'5ITFT k-ti-34 t;ri

ITT A xi a d

*tr-A7 :

Rifffrt A

MTE-12

B1

B2

B3

Al

A2

A3

11

P.T.O.

14

7. () PiiifZiRsict LP WT

z = xl 2x2 3x3 T

*1177

2x1 + 3x2 + 3x3 = 2

2x1 + 3x2 + 4x3 = 1
x1, x2, x3 _> 0.

(1=4)

trft-4-e

3ur
gIT- aTrimer

-11-d rqqi ITT

Wi.
16
F1

180
8

F2

26

el

24

*rf1
4

MTE-12

180

120

Tzr
pe.04.1

12

TO

12
0

200

160

18

16
0

F3

ITTTT

W3

W2
20

14

Tirrff

150

Trzrr r

90

450

Pe.11-1 t I ei rc

3,000