
	Trending ▼ ICSE CBSE 10th ISC CBSE 12th CTET GATE UGC NET Vestibulares ResFinder

Operations Research (Elective I) (October 2009)

5 pages, 37 questions, 0 questions with responses, 0 total responses,

	pune_eng	+Fave Message
	Profile Timeline Uploads Q & A

Home > pune_eng >

Formatting page ...

Total No. of Questions : 6] P971 [Total No. of Pages :5 [3664] - 130 B.E. (Mechanical) OPERATIONS RESEARCH (2003 Course) (Sem. - I) (Elective - I) Time : 3 Hours] Instructions to the candidates: 1) 2) 3) 4) 5) [Max. Marks:100 Answers to the two sections should be written in separate books. Neat diagrams must be drawn wherever necessary. Figures to the right indicate full marks. Use of logarithmic tables, slide rules, Mollier charts, electronic pocket calculator and steam tables in allowed. Assume suitable data, if necessary. SECTION - I Q1) A company makes two kinds of leather belts. Belt A is a high quality belt and belt B is of a lower quality. The respective profits are Rs. 4 and Rs. 3 per belt. Each of type A requires twice as much time as belt of type B, and if all the belts were of type B, the company could make 1000 per day. The supply of leather is sufficient for only 800 belts per day (both A and B combined). Belt A requires a fancy buckle and only 400 days per day are available. There are only 70 buckles available for belt B. What should be daily production of each type of belt? Formulate the linear programming problem and solve it by simplex method. [16] OR Q1) Solve the following LP problem by using the two-phase simplex method: Minimize Z = xl + x2 [16] Subject to the constraints 2x1+ 4x2 > = 4 x1 + 7x2 > = 7 And x1, x2 > = 0. P.T.O.

Formatting page ...

Additional Info : 2003 Course
Tags : Pune, Engineering, University of Pune, Engineering question papers, Pune University, previous year question papers, question papers, india, model question paper, pune university paper pattern, pune university syllabus, old question papers

pune_eng chat

Horizontal lines at:
Guest Horizontal lines at:
AutoRM Data:
Box geometries: