BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination June, 2017

Similar documents
BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination June, 2013 ELECTIVE COURSE : MATHEMATICS MTE-12 : LINEAR PROGRAMMING

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination December, 2015 ELECTIVE COURSE : MATHEMATICS MTE-08 : DIFFERENTIAL EQUATIONS

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination

BACHELOR'S DEGREE PROGRAMME

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination ELECTIVE COURSE : MATHEMATICS MTE-02 : LINEAR ALGEBRA

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination. June, 2018 ELECTIVE COURSE : MATHEMATICS MTE-02 : LINEAR ALGEBRA

MTE-04 BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination December, 2012 ELECTIVE COURSE : MATHEMATICS MTE-04 : ELEMENTARY ALGEBRA

No. of Printed Pages : 8

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination December, 2014 ELECTIVE COURSE : MATHEMATICS MTE-06 : ABSTRACT ALGEBRA

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination June, 2017

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination December, 2015

ELECTIVE COURSE : MATHEMATICS MTE-08 : DIFFERENTIAL EQUATIONS

MASTER OF ARTS (ECONOMICS) Term-End Examination December, 2012 MECE-001 : ECONOMETRIC METHODS

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination December, 2012 ELECTIVE COURSE : MATHEMATICS MTE-10 : NUMERICAL ANALYSIS

No. of Printed Pages : 8

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination June, 2016 ELECTIVE COURSE : MATHEMATICS MTE-1 3 : DISCRETE MATHEMATICS

ST. JOSEPH S COLLEGE OF ARTS & SCIENCE (AUTONOMOUS) CUDDALORE-1

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination December, Time : 2 hours Maximum Marks : 50 (Weightage : 70%)


B.Sc. Examination December, 2015 CHE-01 : ATOMS AND MOLECULES AND CHE-02 : INORGANIC CHEMISTRY

L..4 BACHELOR'S DEGREE PROGRAMME MTE-05 : ANALYTICAL GEOMETRY

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination December, 2015 (APPLICATION ORIENTED COURSE) AOR-01 : OPERATIONS RESEARCH

PHYSICS PHE-14 : MATHEMATICAL METHODS IN PHYSICS-III

MTE-10 BACHELOR'S DEGREE PROGRAMME (BDP)

No. of Printed Pages : 12 MTE-11 BACHELOR'S DEGREE PROGRAMME

A L A BA M A L A W R E V IE W

BACHELOR'S DEGREE PROGRAMME MTE-05 : ANALYTICAL GEOMETRY

rhtre PAID U.S. POSTAGE Can't attend? Pass this on to a friend. Cleveland, Ohio Permit No. 799 First Class

BACHELOR'S DEGREE PROGRAMME (BDP PHILOSOPHY)

BACHELOR OP SCIENCE (B.Sc.) Term-End Examination June, 2018

~,. :'lr. H ~ j. l' ", ...,~l. 0 '" ~ bl '!; 1'1. :<! f'~.., I,," r: t,... r':l G. t r,. 1'1 [<, ."" f'" 1n. t.1 ~- n I'>' 1:1 , I. <1 ~'..

No. of Printed Pages : 7 BACHELOR OF SCIENCE (B.Sc.) Term-End Examination December, 2013 PHYSICS

Note : Answer the questions as directed in SECTION A, B and C. Draw neat labelled diagrams 'wherever necessary.

MASTER OF ARTS (ECONOMICS) Term-End Examination June, 2010 MEC-003 : QUANTITATIVE TECHNIQUES SECTION - A

Term-End Examination. June, 2012 LIFE SCIENCE

No. of Printed Pages : 12 BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination 00 0 y 4 December, 2016

Bachelor s Degree Programme Operations Research (Valid from 1st January, 2012 to 30th November, 2012.)

BACHELOR OF SCIENCE (B.Sc.) Term-End Examination

UNIT-4 Chapter6 Linear Programming

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination. June, 2017 ELECTIVE COURSE : MATHEMATICS MTE-08 : DIFFERENTIAL EQUATIONS

BACHELOR OF SCIENCE (B.Sc.) Term-End Examination -June, 2012 MATHEMATICS MTE-3 : MATHEMATICAL METHODS

2. Linear Programming Problem

UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc. Mathematics (2011 Admission Onwards) II SEMESTER Complementary Course

BACHELOR OF SCIENCE (B.Sc.) Term-End Examination June, 2015 LIFE SCIENCE LSE-06 : DEVELOPMENTAL BIOLOGY

BPHE-101/PHE-01/PHE-02 BACHELOR OF SCIENCE (B.Sc.) Term-End Examination, December, 2015 PHYSICS BPHE-101/PHE-01 : ELEMENTARY MECHANICS

Dr. S. Bourazza Math-473 Jazan University Department of Mathematics

BACHELOR OF SCIENCE (B.Sc.) Term-End Examination June, 2015

BACHELOR'S DEGREE PROGRAMME Term-End Examination June, Time : 2 hours Maximum Marks : 50 (Weightage : 70%)

Helping Kids Prepare For Life (253)

No. of Printed Pages : 8 I LSE-09(S)

OMT-101 : Preparatory Course in General Mathematics (Revised)

P a g e 5 1 of R e p o r t P B 4 / 0 9

Graph the linear inequality. 1) x + 2y 6

CBSE QUESTION PAPER. MATHEMATICS,(1)1d

BACHELOR OF SCIENCE (B.Sc.) Term-End Examination June, B.Sc. EXAMINATION CHE-1 : ATOMS AND MOLECULES AND CHE-2 : INORGANIC CHEMISTRY

No. of Printed Pages : 12 MTE-14 BACHELOR'S DEGREE PROGRAMME (BDP)

Lecture 7 Duality II

Concept and Definition. Characteristics of OR (Features) Phases of OR

OPERATIONS RESEARCH. Michał Kulej. Business Information Systems

6. Linear Programming

Lecture Notes 3: Duality

Note : Attempt four questions in all. Questions No. 1 and 2

MATH 210 EXAM 3 FORM A November 24, 2014

Today: Linear Programming (con t.)

Class Meeting #20 COS 226 Spring 2018

BACHELOR OF SCIENCE (B.Sc.) Term-End Examination December, 2009 PHYSICS PHE-15 : ASTRONOMY AND ASTROPHYSICS

No. of Printed Pages : 8

Last 4 Digits of USC ID:

OH BOY! Story. N a r r a t iv e a n d o bj e c t s th ea t e r Fo r a l l a g e s, fr o m th e a ge of 9

BACHELOR OF SCIENCE (B.Sc.) Term-End Examination December, 2013

Chapter 3 Introduction to Linear Programming PART 1. Assoc. Prof. Dr. Arslan M. Örnek

Motivating examples Introduction to algorithms Simplex algorithm. On a particular example General algorithm. Duality An application to game theory

Affidavit and Revenue Certification Chimp Haven, Inc. Caddo Parish Keithville, LA

4.6 Linear Programming duality

35H MPa Hydraulic Cylinder 3.5 MPa Hydraulic Cylinder 35H-3

National Parks and Wildlife Service

BACHELOR OF SCIENCE (B.Sc.) Term-End Examination 00 June, 2012.czt. PHE-07 : ELECTRIC AND MAGNETIC PHENOMENA

176 5 t h Fl oo r. 337 P o ly me r Ma te ri al s

Understanding the Simplex algorithm. Standard Optimization Problems.

Exam. Name. Use the indicated region of feasible solutions to find the maximum and minimum values of the given objective function.

9.9 L1N1F_JL 19bo. G)&) art9lej11 b&bo 51JY1511JEJ11141N0fM1NW15tIr1

Note : Attempt all questions. The marks for each question are indicated against it. Symbols have their usual meanings. You may use log tables.

Deterministic Operations Research, ME 366Q and ORI 391 Chapter 2: Homework #2 Solutions

Review Questions, Final Exam

56:270 Final Exam - May

Transportation Problem

Example: 1. In this chapter we will discuss the transportation and assignment problems which are two special kinds of linear programming.

Introduction to Mathematical Programming

15-780: LinearProgramming

I N A C O M P L E X W O R L D

II BSc(Information Technology)-[ ] Semester-III Allied:Computer Based Optimization Techniques-312C Multiple Choice Questions.

No. of Printed Pages : 19. B.Sc. Examination CHE-01 : ATOMS AND MOLECULES AND CHE-02 : INORGANIC CHEMISTRY

o Alphabet Recitation

02/05/09 Last 4 Digits of USC ID: Dr. Jessica Parr

Ü B U N G S A U F G A B E N. S p i e l t h e o r i e

Beginning and Ending Cash and Investment Balances for the month of January 2016

...(iii), x 2 Example 7: Geetha Perfume Company produces both perfumes and body spray from two flower extracts F 1. The following data is provided:

ECE 307- Techniques for Engineering Decisions

PHE-5 : MATHEMATICAL METHODS IN PHYSICS-II Instructions : 7. Students registered for both PHE-4 & PHE-5 courses

OF FIRE. No. of Printed Pages : 11 BSEI-025. DIPLOMA IN FIRE SAFETY Term-End Examination December, 2012 BSEI-025 : INTRODUCTION AND ANATOMY

Transcription:

No. of Printed Pages : 12 MTE-121 BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination June, 2017 ELECTIVE COURSE : MATHEMATICS MTE-12 : LINEAR PROGRAMMING Time : 2 hours Maximum Marks : 0 (Weightage : 70%) Note : Question no. 1 is compulsory. Do any four questions out of questions no. 2 to 7. Use of calculators is 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 a counter-example. x2=10 (a) (b) (c) The LPP, maximizing z = - x 2 subject to x1 + x2 1, 0.xi + x2 0 and xi 0, x2 0, has no feasible solution. If a negative value appears in the solution column (xb) of the simplex method, then the basic solution is unbounded. If the variables in a primal problem are all greater than, or equal to zero, then the variables in the dual problem would be less than or equal to zero. MTE-12 1 P.T.O.

(d) The value of the game I II III IV I - 3 1 II 0 6 III -4-2 4 7 2 6 8 is 6. (e) The minimum number of lines covering all zeros in a reduced cost matrix of order n in an assignment problem can be at least n. 2. (a) Formulate the dual of the following LPP : Maximize z = 2x 1 + x 2 subject to the constraints x 1 + x 2 10 x + 3x 2 6 2x 1 8 x 2 0 and x 1 unrestricted. The dual must have exactly two constraints and three variables. (b) Solve graphically the following LPP : Maximize z = 3x 1 + 2x2 subject to the constraints - 2x1 + x2 1 x1 _ 2 xi + x2 3 x1, x2 0. MTE-12 2

3. (a) Use simplex method to solve the following LPP : Maximize z = x 1 + 3x 3 subject to the constraints x + 3x < 10 1 3 - xi + x2 x1, x2, x 3 0. Also, compute one more alternate optimal solution if it exists. (b) Solve the following game graphically : -2 0 3-1 -3 2-4 4. (a) Five men are available to do five different jobs. From past records, the time (in hours) that each man takes to do the job is known and given in the following table : Men A B C D E Jobs II III 2 9 2 7 1 6 8 7 6 1 4 6 3 1 3 9 1 4 2 7 3 1 Find the assignment of men to jobs that will minimize the total time taken. Also, compute the time. MTE-12 3 P.T.O.

(b) Solve the following LPP using the two phase simplex method : Maximize z = 3x 1 + 2x2 + x3 subject to the constraints - 3x 1 + x 3 = 8-3x 1 + 4x 2 + x 3 = 7 x1, x2, x3?_ 0.. (a) Use dominance principle to solve the game whose pay-off matrix is given by Player A I [ II III IV I 6 2 Player B II III 6 4 6 4 4 6 4 2 IV 2 6 2 10 Also, find the value of the game. 6 (b) A Chemistry laboratory uses raw material I and II to produce two domestic cleaning solutions A and B. The daily availability of raw materials I and II are 10 and 14 units respectively. One unit of solution A consumes 0. units of raw material I and 0.6 units of raw material II and one unit of solution B uses 0. units of raw material I and 0.4 units of raw material II. The profit per unit of solutions A and B are 8 and 10 respectively. The daily demand for solution A lies between 30 and 10 units and that for B between 40 and 200 units. Formulate the above data as LPP. 4 MTE-12 4 4

6. (a) For the following problem in the game theory, formulate the problem of finding the optimal strategies for player A and player B as linear programming problem : Player B 1 2 2 Player A 0 2 6 4 2 6 (b) Find the initial basic feasible solution of the following transportation problem to minimize the cost using matrix-minima method : Warehouses W1 W2 W3 W4 Capacity F 1 7 3 8 300 Factories F2 4 6 9 00 F3 3 6 4 200 Demand 200 300 400 100 Hence, find the optimal solution. 7. (a) Consider : S = {(x, E R2 I xy x 1,y 1, x 0, y 0}. Is S a convex set? Give reasons. Determine the convex hull of S and describe it using mathematical inequalities. 4 MTE-12 P.T.O.

(b) Consider the following transportation problem : S 2 S 3 b.-> D 1 D 2 D 4 D 40 0 30 10 70 100 80 7 6 20 30 60 4 0 40 1 2 20 10 20 a. 4, 20 20 0 If u 1 = - 1, u2 = 20, u3 = 0, v 1 = 30, v2 = 60, v3 = 4, v4 = 2, v = 0, then find the corresponding basic feasible solution of the problem. Is this solution optimal? Give reasons. 6 MTE-1 2 6

71.t.1.-12-1114) 341 40 S1144 T4, 2017 ' /WtW.1.11 9t)1.4 : 1 11j ICI "crgi.t.t.-12 : (Slch 1,114.1.1 HAN : 2 Wu2 31-r 3 : 0 (mf r : 70%) #. 1'<i13 /AT 4. 2 4 7 PI 4 W7? / cic-,dej 3Te7T 4,4 3.7-q-0 07* / 1. odiv 4) PIH orgd war-4 Hrect 37-R-R7 ITi-rwi 3trIA Nc- qwuf 3TT 371k chlkuf.-d-qr I x2=10 () -1briT4 NCI I, z = - x2 f 3TR1-*--di#W{71 *f.n7 77k xi + x2 S 1, 0.x 1 + x2 0 at xi > 0, X2 0 Tide t (13- ) -cr-wil-r MT* -1:Trni (3( B) e4r 7rtutic4l.b t, 3Trtrrft 3Tqft-oz t (Tr) qr 3Tr-cr TrTr-fzrr *Rift A. 331W t, Trgr-FErr * * -qfr * tsklel.k Zif 7LP:I err 1,--e4 I MTE-12 7 P.T.O.

(Er) LAM I II III IV I - 3 1 II 0 6 III - 4-2 4 IV 7 2 6 8 ftzid-4 TrA-fErr A, n lirizi1 A k-ei IRA n Tr*-t t I ff-d14 2. () 111 1").71W4 TII:RzFT *"1 Tkrqff z = 2x 1 + x 2 3irWallt*TIT*r-41 1:1 4-1R161 -&T-4611* 3T- Th x 1 + x 2 <- 10 x 1 + 3x 2 > 6 2x 1 < 8 a x 2 >04R x 1 347r-d-A-u -4 - gl.t) th-r- 3Tr-4q-zr- (1g) PHRIRgd tgra-4 Tri:R=41 7rfrer 'MT z = 3x 1 3-TRT+7141-*-TuT 1:1 4-11CIRVI - 2x 1 + x 2 <- 1 x 1 < 2 x + x < 3 1 2 - x 1, x2 0. MTE-12 8

3. trap:17 ITIWTE T 1-4RT z x 1 + 3x3 $it 3TRWdlit*TIT*fr7R PiHRiRgi x 1 + 3x 3 < 10 x + x < 1 2 X1' x2, x3 0. -> c..on PdC1 1-1 ca t, cb.1 4-1 orgct 9TOzr fq-nt (.1*'1.NR : l4 2 0 3 1 3 2 4 4. () ITN fat-ff cnk4 ate-01 zrr-o-ati t Ivi4 31144a1 3{pft Asstcb(4 11) tin t 311T PHRIRgi fffr MW1 14 igen TRIT : 31-r-4-Lft A B C D E 161 IV 2 9 2 7 1 6 8 7 6 1 4 6 3 1 3 9 1 4 2 7 3 1 31-KFTRII 1-44T4 fdf fff-zrr Trzrr Trrrzr * I TP:14 1-1RchRi Ci WA-R MTE-12 9 P.T.O. V

i 4-'1RiRgd -srliztf TP:F;Eff t- -crul ITT -rea : z = 3x 1 + x3 T 77 --44t41* 3x 1 + x 3 = 8-3x 1 + 4x 2 + x 3 = 7 x1, x2, x 3 > 0.. -rrjum wrirt cht, PiHRi (1 1IlH Atr-A7 : Rgc-114 B I II III IV I 6 4 2 fil(11 9 A II 6 4 6 III 6 4 6 2 2 4 2 10 ITR ift 411c1 Arr-4R I 6.1-) kwlelpich 1e11 1 R11(11 Trchr 1-4-07R A 311T B *114 rml ctri34 c 13I II w 7-41-rr. 7-d1t I chi A II4t 7r-oTig-d-r 9b 4-RI: 10 31 14 cf-oeil I 14ffzR A t, T*-11 ch-cd 411(.4 141 0. W4 A chi Trra II 0.6c*--f TE-4't -4 A fa o-4-4 13. 1.> T*-r i ch -cd HIM I 0. 3 ch-c MO II 0.4 T*-4.frth t I fdazr A 3 t B - r UPI -ff13-1 stari: 8 3i 10t I id-07r A *1 *TT 30 A 10r+7z11 3-11( Wez:14 B trt- Trirr 40 34i 200 T*-rzil *t ti 34-*71 tgrq-4 TrIR:ziT 7 I 4 MTE-12 10

6. () "RTZT- 4t1 Hrrl 1 1 wrzrr 1(goi A 3 Rgc-10 B -1Z-R tra -41-41 lit E Trlwrrq I:FR:Err kr-1-u 4tF-4l : 6(10 B 1 2 2 1I A 0 2 6 4 2 6 1:14--ci rift-4f chkui chk:.) 1 i-mac 14N -9-Frmi- 3Trti-rft Th-rff : Trl-q-rrr W1 W2 W3 W4 klirdt F 1 7 3 8 300 ohlkn I F2 4 6 9 00 F3 3 6 4 200 TaTT 200 300 400 100 'Fr NchR, 41Ic1 QN7 I 7. PIHRifigd : S=Rx,y)E112-47IT S t&ch 31---a-rju Trg-*--zr? ctaul tf--ar ki 4-11clich 4-Ild W77 TriVrt4 34Trrgw[311 -FOr i-r-a7 I 4 MTE-12 11 P.T.O.

(t) e_lcrtrit--4-64 TrI:RErr S i S 2 S 3 D D 2 D 3 D 4 D 40 0 30 10 70 100 80 7 6 20 30 60 4 0 40 a. 20 20 0 b. > J 1 2 20 10 20 e4r u, = 1, u2 = 20, u3 = 0, v 1 = 30, v2 = 60, v3 = 4, v4 = 2, v = 0 *, crit.7* 34-1 cr 31mt crii Tff1=1.? chrui tnr I 6 MTE-12 12 3,000