0% found this document useful (0 votes)
110 views12 pages

Mte 12

This document is a 12-page exam for a linear programming course. It contains 7 multiple part questions testing various concepts in linear programming. The questions cover topics like identifying true/false statements about linear programming, formulating linear programming problems, solving linear programs graphically and using methods like the two-phase method, and interpreting solutions. The document provides context, questions, and space for students to show their work in solving the linear programming problems.

Uploaded by

PrinkuDihedral
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
110 views12 pages

Mte 12

This document is a 12-page exam for a linear programming course. It contains 7 multiple part questions testing various concepts in linear programming. The questions cover topics like identifying true/false statements about linear programming, formulating linear programming problems, solving linear programs graphically and using methods like the two-phase method, and interpreting solutions. The document provides context, questions, and space for students to show their work in solving the linear programming problems.

Uploaded by

PrinkuDihedral
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

No.

of Printed Pages : 12 MTE-12 I


BACHELOR'S DEGREE PROGRAMME
(BDP)
Term-End Examination
ri 36S June, 2018

ELECTIVE COURSE : MATHEMATICS


MTE-12 : LINEAR PROGRAMMING
Time : 2 hours Maximum Marks : 50
(Weightage : 70%)

Note : Question no. 1 is compulsory. Answer any


four questions from questions no. 2 to 7. Use of
calculators is not allowed.

1. Which of the following statements are True and


which are False ? Give a short proof or a
counter-example in support of your answer. 5x2=10

(a) There is no convex set with exactly three


points.

(b) In a solution of a two-dimensional LPP, the


objective function can assume same values
at two distinct extreme points.

(c) For a 3 x 3 matrix A with I A I= 3, I Adj A I


is equal to 9.
MT E-12 1 P.T.O.
8 2 3

(d) The pay-off matrix 3 5 6 has no

5 8 9
saddle point.

(e) In a balanced transportation problem with


3 sources and 4 destinations, if the
availability at the first source and the
requirement at the first destination are
equal, then the North-West corner method
gives exactly 6 basic cells.

2. (a) In a game of matching coins with two


players, suppose A wins one unit of value
when there are two heads, wins nothing
when there are 2 tails and loses 1/2 unit of
the value when there is one head and one
tail. Determine the pay-off matrix and
optimal strategies for each player and the
value of the game.
(b) A factory uses three different resources P, Q
and R for the manufacture of two different
products A and B. A total of 20 units of P,
12 units of Q and 16 units of R are available.
1 unit of product A requires 2 units of P,
2 units of Q and 4 units of R; whereas 1 unit
of product B requires 4 units of P, 2 units of
Q and 0 unit of R. One unit of product A
when sold gives a profit of 200, and one
unit of product B when sold gives a profit of
300. Formulate the linear programming
problem. How many units of each product
should be manufactured for maximizing the
total profit ? Solve it graphically.
MTE-12 2
3. (a) Four salespersons are to be assigned to four
territories. The returns (in thousands of T)
obtained on assigning each salesperson to
each territory is given in the following
table :

Salespersons
II III IV
A —1 —2 3 4
B 2 —4 3 5
Territories
C 4 3 —6 7
D 3 2 5 7

Find an assignment that maximizes the


returns. What is the maximal return ? 4

(b) Solve the following LPP by the two-phase


method and give your conclusions about the
solution : 6

Maximize z = 3x 1 + x2
subject to
2x1 + x2 4
x2 >_2
x1,
1, x2
2
> 0.

MTE-12 3 P.T.O.
4. (a) Obtain the dual for the following LPP : 3
Minimize z = 3x 1 + 9x2 + 8x3
subject to
2x 1 + 4x2 — 8x3 > 5
4x 1 — 2x 2 + 4x 3 >- 9

— 8x 1 + 3x3 <- 8

x1, x2, x3 0.

(b) Find the initial basic feasible solution using


North-West corner method for the following
transportation problem :

Warehouse

W1 W2 W3 Supply

16 20 12 200

Factory F2 14 8 18 160

F3 26 24 16 90

Demand 180 120 150

Also, find the optimal solution. 7


MTE-12 4
5. (a) Write the LPP form of the following
transportation problem : 4

Destinations
D1 D2 D3 D4 Supply

01 5 11 2 6 40

Sources 02 4 9 7 1 30

03 3 1 4 3 30

Demand 30 20 10 40

(b) Solve the following game graphically : 6

B
1 —3
3 5
—1 6
4 1
6. (a) Formulate a suitable LPP of the game with
respect to minimizing and maximizing
players : 5

Player B
0 —10
Player [5
A 10 6 2
20 15 10
MTE-12 5 P.T.O.
(b) Sketch the region {(x, y) I x 2 + y2 1, y2 5 x}.
Is the region convex ? Justify your answer. 3

(c) Find all values of k for which the vectors


1 1 k
0 , —1 and — k are linearly
1 0 2
independent. 2

1 1
7. (a) Express P (- , — ) as a convex linear
24
combination of A (0, 0), B (0, 1) and C (1, 0).
(b) Find all the basic solutions of the following
system :
4x 1 + 2x2 + x3 = 4

2x 1 + x2 + 5x3 = 5

MTE-12 6
71:1.t.i. -12

7ZIT-6W 4441 chl


)
TrAta. titiVr
x,2018

tech xi crsbm :
71:r.t.t.-12 ARM 54

: 2 Etu2 367WW:f 3795:50


(35c-/ 70%)

alz R 4. arkaref Nw 2 4 7 ri 47---e7


1 0(.11
Wrf NW. 9 3W? 007 / arldej wr Rev 954
arivf# 70,1 /
1. tsii4A- v19.4 wiR RC T # 3 cr1-1-14
? 3Ttr4 \irk tre 4 TifkitTr z-crEA- 3T441
NrSCWu l tr* I 5x2=10

() dlcr) At4 RIsal1 am' 414 31-073 tt-cati


t
(w) LPP 4, Z04 TF-e'ff TF 1TT-4
3TUIT-3707 f ?ESA WTPTfq ticha t

(ii) 3 x 3 3T1R0 A "NW+1- tiikPich


I A I= 3 t, .3(14) (-1 44S\31 I Adj A l
9 @Ali I

MTE-12 7 P.T.O.
8 2 3
TMR alTmEg 3 5 6 W ct) 1:frfur
5 8 9_
Ter t I
3 41c11 4 4-eMa. trit4F FITFIT
zrft -srAR ztra-dum 31.41:1 :TitcNti
Tigifq t, T4 TflT-TrWT m1-I1 fa-RT ct)
6 aint cArt---dcni -Nat I
2. ITTFT4
rtietel)
4, Trra- #11* -I* A *dUT Ae46
NTEA t, AT To Ift Ter 11A-a-r 7A% t
TE ARE !) - 3f1 112 r*-14 Ac16
Awr trz srrqr t I R aTrao
*At. *1.NR 3tTAc Riro-rt fo7
fm--At tri*An AAT-4R J 4
*Wet RIA:RTR 3-0:ri-41 A 311T B T dt-Luq.i
cr)t 4tR. -R.TA-N71 1:4TrIT-41 P, Q 311T R
mei II cbtcfl t I To icitcht P *I" 20 *chwit, Q
t 12 chivii 311T R 't 16 chiVit
t I dc-Liiq A 11- *r *-4
P tr 2 *chivii,
Q 2 *chwii 311T R t 4
37-4FF*7T 1:14t *; q.-4% cIIq B *r 1 r*T4
cs.R P At 4 T*1-4-41, Q *t 2 T*7-4.41 "MIT R Ar
0 r*Tit 3TRFWT t I dc-kilq A
a ITT- 200 W. W1-1. alai W4T dcciiq
B *t *cbii qa TIT 300 W WIT -)11 t I
r(sich 31-bMq Tet- Tur 4R *11-
aTrir*--dxf 3c4 1q -kat
3C41q.-1 chti I ?r-Pel Mi 4
R I 6

MTE-12 8
3. () Sri fr * 4.q Atifftff #
sit-0)41 * fZi‘ f4TiT ►r -T4 ft
4) Pi-ifZiRgo wri'- wr 4

I II III w

A 1 —2 3 4
B 2 —4 3 5
4-1
C 4 3 —6 7
D 3 2 5 7

* .wr PeicH Ta. *ti*


NR4 1* -srft affiwgr t aTfir+--dgr 3rrfea-
? 4

Pi-ifZiRli 16.41 tgrgr-4 TrgrFrr acRui


Ta*Ii* alt“ - * A-V4 aTcr4 14tchti :
z = 3x1 + x2 W. aTtir+---41*-wr

2x1 + x2 4

e x2 > 2

x2 >_ 0.

MTE-12 9 P.T.O.
4. () P4-4;160 LPP tet TITt7f *ri* : 3
z = 3x1 + 9x2 + 8x3 ' Ti -twilebtui tti7R

2x 1 + 4x2 — 8x3 5

4x 1 — 2x2 + 4x3 9
— 8x 1 + 3x3 5.. 8

x1 , x2, x3 ?. 0.

(Ta) PHRIRsid Tri:R:Tr it .ilk-fir


fa-RT rk-r -9-Frar thff Ta-
*'rrq7 :
Ji

W1 W2 W3 Tr4
F1 16 20 12 200

14 8 18 160

26 24 16 90

180 120 150

TR-dgr Ta- *=rr-A7i 7

MTE-12 10
5. xerdp T f LPPW:f : 4

D1 D2 D3 D4

01 . 11 2 6 40

ii 02 4 9 7 1 30

03 3 1 4 30

*IT 30 20 10 40

NO P4-11Cirtsii t;(-1, f411T 4 W4R : 6

B
1 -3
3 5
A
-1 6
4 1

6. ‘q aTIWWIT*Ttt
voiletal Rgoi *Fa' LPP It-ftff
'a* :
ftirdTt B
5 0 -10
RirOT-41A 10 6 2
20 15 10

MTE-12 11 P.T.O.
51 41 {(x, y) I x2 + y2 > 1, y2 < x)

*e4R I
I WIT 5IkI 3T-41pr ? 3itr4 39T At
3
(TT) k 3R- 'Pt TIT-4 'Q" Ta• *IN7 rA-14.) rrl

ti 41
1

1
-
1

0
1 -k

2
c: tc
ti • I 2

7. ) 13 (12- , 41 4 A (0, 0), B (0, 1) 3 c (1, 0)*


3T-413u 1%4, A711-4q vcr w*rf*RI 4

141-iRiRqd Pctoti Trift 3Trq-rft Tff


:
4x1 + 2x2 + x3 = 4

2x1 -Fx2 +5x3 =5

12 3,500
MTE-12

You might also like