1!

\OIA:'\ INSTITUTE OF TECH:\OLUGY

Date Sept. 2016 Time 2 Hours I'ull Mark:; 60 Number of students: 60

Autumn Semester: 2016 Dept.: Mining Lngmccr ing Subject No. : \1131007
III Y car B.Tech Subject "!:Jllle Quantitative Decision Making

Instructions: Answer all questions. Figure in Illdi"glll Indicate marks. Graph paper will
he -upplied.

A company manufactures two products A and B 011 which the profits earned per unit are
Rs 300 and Rs. 400 respectively. Each product I~ processed on two machines M I and
iV12 respectively. Product A requires one minute of processing time on machine M I and
t\\(' minutes on machine M2, while product 8 rC'jL;t.'·:-- on.: minute or processing time on
machine M I and one minute on machine M2.
Machine M I is available for not more than 7 hours .ind 30 minutes per day while machine
\112 is available for not more 10 hours per day.
(i ) Formulate the problem as a linear programming problem to find the number of
units of Product A and Product B to be manufactured per day to get maximum
profit. (5)
(ii) Find the optimal solution by the graphical solution to get the maximum profit.
Show the feasible region on the-graph paper. (10)

-, (ullsider the following linear programming problem {IS)

Maximize Z = 12XI + 8X2

Subject to :
4X1 + 3X2 ~ 12 (Resource A)
4XI + X2 ~ 8 (Resource B)
4XI - Xl ~ 8 (Resource C)

(i) Find the optimal solution by the simplex method.

(ii) Determine the status (scarce or abundant) of each resources.
(iii) Evaluate the economic worth of resources.

3 Determine the minimum value of the following linear programming problem (20)
using the Big M method.

Subject to:
3XI + X2 = 3
4Xl + 3X2 ~ 6
x, + 2 x, ~3
and x, ~ 0, X2 ~ 0
(Q) V\"h,l;h [he network [hwdd O! opunuvauon, expbin it bnefly Wllh proper diagram
;I\ld the L'nmponent"s ofthe /1("(\\ ork (4)
(b) Pro , I(i;: some possrbl.: appf{l"".d!!~'"'n~(Ii !h~ same in minillg and
tilled engineering
eas(~" (3~
(e) Mention anv five important algorubms or network model based optimization 0)