Scribd
Upload
128 views2 pages

Decision Modelling

1. The document presents a midterm exam for a decision modelling course consisting of 4 questions. Question 1 involves formulating an optimal product mix problem as a linear programming problem (LPP). Question 2 involves solving two LPPs using different methods. Question 3 involves using transportation methods to solve a transportation problem. Question 4 involves formulating a job assignment problem as an LPP and solving a shortest path network problem.

Uploaded by

K Pushpendu Prashant
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
128 views2 pages

Decision Modelling

1. The document presents a midterm exam for a decision modelling course consisting of 4 questions. Question 1 involves formulating an optimal product mix problem as a linear programming problem (LPP). Question 2 involves solving two LPPs using different methods. Question 3 involves using transportation methods to solve a transportation problem. Question 4 involves formulating a job assignment problem as an LPP and solving a shortest path network problem.

Uploaded by

K Pushpendu Prashant
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/ 2

National Institute of Technology, Rourkela

B.Tech. 7th Sem, ME/ID, 2015-16 Autumn, Mid Sem Exam


ME-431 : Decision Modelling

Full Marks : 60 Time : 2 Hours No. of Pages = 2 Dept = ME

ALL four questions are compulsory.Figures at the right hand margin indicate marks.

Q.1. a A firm manufactures three types of products A, B and C. The cost of 6


producing one unit of these products are Rs. 2, Rs. 3 and Rs. 5 respectively. It
has two machines M and N. The processing times in hours for one unit of
products A, B and C on machine M are 5, 6 and 7 respectively. The similar
hours required on machine N are 3, 2 and 5 respectively. The maximum
available machine hours for M and N are 300 and 400 hours respectively. The
firm must manufacture a minimum of 100 units of A. Maximum demand of C
is 500. The production of C should not exceed that of B. Formulate it as LPP
to decide optimal product mix.

b Find the dual of the following LPP.


Minimize z = 5x1 + 7x2 6
Subject to: 2x1 - 6x2 20
3x1 + 4x2 30
-x1 + 2x2 = 40
and x1 is unrestricted in sign, x2 0.

Q.2. Solve the following LPP by simplex method and graphical methods. 16
Maximize z = 3x1 + 2x2
Subject to: 2x1 + x2 1
x1 2
x1 + x2 3
and x1, x2 0.
Graphically show the solutions obtained at the end of each iteration.
OR

Solve the following LPP by dual simplex procedure.


Minimize z = 5x1 + 3x2
Subject to: x1 + 2x2 6
5x1 + 2x2 10
x1 + x2 = 5
and x1, x2 0.
Q.3 The unit costs of transportation from various plants to warehouses are given 16
below. The demand/supply of all the warehouses/plants are also shown. Find
the initial solution by least cost method OR Vogels approximation method.
Keep on improving the solution till optimality is reached. Is the solution non-
degenerate?
Warehouses
Cij E F G Supply
A 2 7 4 5
B 3 3 1 8
Plants
C 5 4 7 7
D 1 6 2 14
Demand 7 9 18

Q.4 a The following table lists down the cost of assigning jobs to various workers. 8
Decide the optimal allocation of jobs assuming that only one job will be
assigned to each worker. Also formulate the above as linear programming
problem.
Machine
Cij A B C D
I 1 4 6 3
II 9 7 10 9
III 4 5 11 7
Job

IV 8 7 8 5

b The following network gives the links and associate lengths in km among 8
various locations. The manufacturing plant is at node 1 and the warehouse is
at node 5. Find out the shortest route for shipping the finished goods from the
plant to the warehouse.

2 20
4
30 30
50
20
40 5
1 3 40

OR

Solve the above network model as minimal spanning tree problem.

You might also like