BACHELOR'S DEGREE PROGRAMME

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, 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, 2012 ELECTIVE COURSE : MATHEMATICS MTE-10 : NUMERICAL ANALYSIS

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

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

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

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

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

No. of Printed Pages : 8

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


K E L LY T H O M P S O N

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

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

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

MTE-10 BACHELOR'S DEGREE PROGRAMME (BDP)

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

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

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

PHYSICS PHE-14 : MATHEMATICAL METHODS IN PHYSICS-III

No. of Printed Pages : 8

CBSE QUESTION PAPER. MATHEMATICS,(1)1d

RI.fi SO -f 3-1f9 q-14 t I ci-) t 1 01, aft r-fld t I

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 December, 2011 CHEMISTRY CHE-04 : PHYSICAL CHEMISTRY

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

BACHELOR'S DEGREE PROGRAMME (BDP PHILOSOPHY)

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

MATH2070 Optimisation

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

~,. :'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 ~'..

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

Term-End Examination. June, 2012 LIFE SCIENCE

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

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

Bachelor's Preparatory Programme (B.P.P.) (For Non 10+2) Term-End Examination December, 2013

ELECTIVE COURSE : MATHEMATICS MTE-08 : DIFFERENTIAL EQUATIONS

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

MATH 445/545 Test 1 Spring 2016

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

56:171 Operations Research Midterm Exam - October 26, 1989 Instructor: D.L. Bricker

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

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

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

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

TRANSPORTATION PROBLEMS

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

BACHELOR'S DEGREE PROGRAMME MTE-05 : ANALYTICAL GEOMETRY

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

UNIVERSITY of LIMERICK

Dec. 3rd Fall 2012 Dec. 31st Dec. 16th UVC International Jan 6th 2013 Dec. 22nd-Jan 6th VDP Cancun News

Optimization 4. GAME THEORY

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

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

Solutions for Math 217 Assignment #3

Bachelor's Preparatory Programme (B.P.P.) (For Non 10+2) Term-End Examination December, 2016

LINEAR PROGRAMMING BASIC CONCEPTS AND FORMULA

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

Trade Patterns, Production networks, and Trade and employment in the Asia-US region

UNIT-4 Chapter6 Linear Programming

OPERATIONS RESEARCH. Michał Kulej. Business Information Systems

15-780: LinearProgramming

BACHELOR OF SCIENCE (B.Sc.)

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

Lecture 8: Column Generation

Answer the following questions: Q1: Choose the correct answer ( 20 Points ):

O CHE-1 : ATOMS AND MOLECULES

National Parks and Wildlife Service

F 1 F 2 Daily Requirement Cost N N N

Operations Research: Introduction. Concept of a Model

Sensitivity Analysis

Decision Mathematics D2 Advanced/Advanced Subsidiary. Monday 1 June 2009 Morning Time: 1 hour 30 minutes

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

THE UNIVERSITY OF HONG KONG DEPARTMENT OF MATHEMATICS. Operations Research I

Exhibit 2-9/30/15 Invoice Filing Page 1841 of Page 3660 Docket No

Optimization - Examples Sheet 1

A Fuzzy Inventory Model. Without Shortages Using. Triangular Fuzzy Number

Introduction to Mathematical Programming

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

1 Introduction JARRETT WALKER + ASSOCIATES. SEPTA Philadelphia Bus Network Choices Report

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

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

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

A/P Warrants. June 15, To Approve. To Ratify. Authorize the City Manager to approve such expenditures as are legally due and

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

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

qfu fiqrqrot sqr*lrq \rq rrrq frmrs rrwtrq, *Ea qqft-{ f,er ofrq qyfl-{ wtrd u'unflq * *,rqrrd drsq GrrR fr;t - oslogllotsfierft

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

Another max flow application: baseball

Lecture 8: Column Generation

Fundamentals of Operations Research. Prof. G. Srinivasan. Indian Institute of Technology Madras. Lecture No. # 15

AM 121 Introduction to Optimization: Models and Methods Example Questions for Midterm 1

Supplementary Information

/3 4 1/2. x ij. p ij

o ri fr \ jr~ ^: *^ vlj o^ f?: ** s;: 2 * i i H-: 2 ~ " ^ o ^ * n 9 C"r * ^, ' 1 ^5' , > ^ t g- S T ^ r. L o n * * S* * w 3 ** ~ 4O O.

II. Analysis of Linear Programming Solutions

Introduction to Linear Programming (LP) Mathematical Programming (MP) Concept

Duality. Geoff Gordon & Ryan Tibshirani Optimization /

ORF307 Optimization Practice Midterm 1

Transcription:

No. of Printed Pages : 11 MTE-12 BACHELOR'S DEGREE PROGRAMME Term-End Examination C 3 ti June, 2012 0 ELECTIVE COURSE : MATHEMATICS MTE-12 : LINEAR PROGRAMMING Time : 2 hours Maximum Marks : 50 Note : Question no. 1 is compulsory. Do any four questions out of 2 to 7. Calculators are not allowed. 1. Which of the following statements are true? 10 Give reasons for your answers : (a) Every convex set has at the most finitely many extreme points. (b) If A and B are 3 x 3 matrices with IAN = 0, then at least one of the matrices A or B has rank less than three. (c) (d) (e) If the primal LPP is infeasible, the dual is also infeasible. In an optimal solution of a balanced transportation problem with 3 sources and 4 destinations, it is possible to have 7 routes over which a positive quantity is transported. The pay off matrix of any game can have at most one saddle point. MTE-12 1 P.T.O.

2. (a) Use the graphical method to solve the 6 following LPP : Max 2x1 + 3x2 subject to x1 + xi x2?-0, x2.?; 0x 1.20 and Ox2.12. (b) Find the dual of the following LPP : Max subject 2x1 + x2 subject to xi +5x25_10, +3x2.- 6, 2x1 + 3x2 = 8, x2?-0 and xi unrestricted. 4 3. (a) Solve the following LPP by simplex method : 5 Max 2x1 +3x2 + x3 subject to 7x1 + 3x2 + 2x3 5 4x1 + 2x2 x3 2 xi, x2, x3 > 0 (b) Write the mathematical model of the 5 following transportation problem : D1 D2 D3 D4 Supply 51 3 7 6 4 5 S2 2 4 3 2 3 S3 4 3 8 5 3 Demand 3 3 2 2 Also, find an initial basic feasible solution using North-West corner method. MTE-12 2

4. (a) Find an initial basic feasible solution using 6 matrix minima method and hence solve the following transportation problem using u v method. From To A B C Available I 6 8 4 14 II 4 9 8 12 III 1 2 6 5 Demand 6 10 15 (b) Find all the basic solutions of the following 4 equations : xi + X 2 + 2x3 = 5 2x1 X 2 + X3 = 4 Which of the solutions are feasible? Justify your answer. 5. (a) Solve the following game graphically : 5 Player B [0 5-3 3 Player A 3 2 (b) Solve the following cost minimising 5 assignment problem : I H Ill IV A 20 28 19 13 B 14 29 15 27 C 38 19 18 15 D 20 27 25 11 MTE-12 3 P.T.O.

6. (a) Prove algebraically that the set 5 S = {(xi, x2) /2xf + x2 5._ 4} is a convex set. (b) Use the method of dominance to reduce the 5 size of the following game, and hence find its solution : 4 1 2 4 2 3 4 3 2 1 5 2 3 2 5 3 7. (a) Players A and B simultaneously call out 5 either of the numbers 19 or 20. If their sum is even, B pays A that number of rupees. If the sum is odd, A pays B that number of rupees. What is the pay off matrix for this game? Find the optimal strategies for both the players. (b) A company has two grades of inspectors, 5 I and II, who are to be assigned for a quality control inspection. It is required that at least 2000 pieces be inspected per 8 - hour day. A grade I inspector can check at the rate of 40 per hour with an accuracy of 97%. A grade II inspector checks at the rate of 30 pieces per hour with an accuracy of 95%. The wage rate of a grade I inspector is Rs. 5 MTE-12 4

per hour while that of a grade II inspector is Rs. 4 per hour. An error made by an inspector costs Rs. 3 to the company. There are only nine grade I inspectors and eleven grade II inspectors available in the company. Formulate the problem of minimising the daily inspection cost as an I,PP. MTE-12 5 P.T.O.

71211.-12 ztrai cro 4cbi-1 trfivi 2012 gicktisto-i : 41ruli 1figet) 41914-11 1-1 Liq : 2./(1 37fiwdTr : 50 1 : rft 31.?-1-7TWq I M.Y1 1 3.7-fi-dRi t 1 Siql 2 4 7 f WT.( drh 0f:3N 47(-11,c.?dj Tr Trehr civ-? `I 1. -11-1 Gcl 4 A cb -I 74 2.N tip t? 3171-4 drlt. t 10 cbruf r\tr (a) 1374T 3-Tq-ITU T111-7E1-'4 t 3-TW A 3419.-- Lirtfi-mcf: -9711 fq-it11 (b) ik A 3th B, 3 x3 311-&F fq-ik IABI =0 t,-4/6ittbaituuwaw1414wgrf*-1:ft cn-r14 iw (c) irq 31Ttf LPP artrrd t 71,1-4 ad1 3ITITM I (d) 3 Tht 3117 4 iftall 4T-01' TirdU tift769' W1:1 c't 14, 7 1:R Ti WIT #1.T-4 t I MTE-12 7 P.T.O.

(e) fc 31-r--&ff Trd-r-i 3fti-T 31-fqw.icht'llt I 2. (a) F'1+-irciroci LPP arn A 60 : 6 2x1 + 3x2 3-ifq-*71:1t-*77 I 7'qfT x1 +x2530, xl x2 > 0, x2.>- 3, 05x1520 bit 05x2512. (b).tati LPP 711c1 : 4 2x1 +x2 3-1fq-*7711M-711T v T : 7-4f- xi +5x2510, xi + 3x2?- 6, 2x1 + 3x2 = 8, x2 >0 34 x1 13TIXF-d-4RTU I 3. (a) 14-110{47 LPP ch) ittz.11 PART 4 Sri : 5 2x1 + 3x2 + x3 WI 3-Tfq--*---d-rn--*---m 7-4F-T 7x1 + 3x2 + 2X3 5 5 4x1 + 2x2 X3 5 2 xi, x2, x3 > 0 (b) 14-1 Oci o.-1 Trr-R:zu f,trukilq 5 tfur : D1 D2 D3 D4 3Trf4 S I 3 7 6 4 5 S2 2 4 3 2 3 S3 4 3 8 5 3 1Ttf 3 3 2 2 alit- 14 -NN bra qiicf "4-177 I MTE-12 8

4. (a) 31.Py wffalt fdlit A Mitt i1t 3-TINTA Ord 6 ql1c1.41-4r atit $TI u v fa-na c-14--iroftgd trft-q-ri Trff-Frr -1 : I 6 8 4 14 II 4 9 8 12 III 1 2 6 5 Trin 6 10 15 (b) (.1 (.1 CI 41rntuI 3TTNTA URI 4 5. (a) x 1 +x 2 + '-) x 3 =5 2x1- )72 4-x3 7-- 4-5--A A Ili 31-0 311( chi f-h--irokld Tia TA Tzaq rcirq fil71v B ftglat[0 5 3 3 1 i A 3 1 1 2] art er1f4r : 5 (b) (4,1RTI fuu (14-1-1C1 4-IchR1 f17-m-9. teaf 7F 5 I II III IV A 20 28 19 13 B 14 29 15 27 C 38 19 18 15 O 20 27 25 11 MTE-12 9 P.T.O.

6. (a) WTtzi Fa F4 Al : 5 S = {(x1, x2) /24 + x2 < 4} kitmciq t (b) rcir(gd 31-1-WR ci.wt4 t 5 1-tit -9-Tgerr fqfq a>> 9717 171 F,TK : 4 1 2 4 2 3 4 3 2 1 5 2 3 2 5 3_ 7. (a) i ilsl A at B 19 71 20 14 11 5 TI124 i zffq a 1 > 417,11:It, B, A c71 c1 4,1GR t I rq 6-1111 q.)41 tf -a-1 A,Ba71 d1irz far t I 74" yr-drff cilr5q1 r ttc-14-11-w -11C1 I (b) t, ttral -.9T1:1-4z7 I 5-0T4Z7, 1147tui chl cf,1 *PA 4 197 \111-11 t I 31-* chi t fef 9Thfq9 8 14 ch4-1 chi-1 2000 aittf 171 (4-) I -14c1-d.( q2 1 40 qtal't 171 'Hcbdi t- 7i11-4. zizttot 97% t I ' MTE-12 10

II.14.4e.( 30.q11 cf 'A.,Tti-cf T7 kichcn t 712.4T 2k 95% t ' I ciic; 1T:Te 7 5 T. mrcf 311-{ II cilc tp4-4z7 =h1 Wit) 7 4 T. 51iscr t tp4-47-{ fe.,1114 3 T. TzfR7 tp4-4z-{ t I tf9t-31.14 0-4 SRI TFR:Err LPP Tcfqff MTE-12 11