1

National Institute of Technology, Rourkela

B.Tech/Dual 7th Sem, ME/ID, 2016-17 Autumn, Mid Sem Exam
ME-431 : Decision Modelling

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

Answer any FOUR questions. Figures at the right hand margin indicate marks.

Q.1. a A product must weigh exactly 100 g. The two raw materials used in 5
manufacturing product are A with a cost of Rs. 1 per unit and B with a
cost of Rs. 6 per unit. At least 12 units of B and not more than 10 units of
A must be used. Each unit of A and B weighs 10 g and 20 g respectively.
How much of each type of raw material should be used for each unit of the
product in order to minimize the cost. Formulate it as LPP to decide optimal
product mix.

b Find the dual of the following LPP.

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

c Maximize z = 2x1 + 3x2 5

Subject to x1 + 2x2 4
x1 + x2 = 3
and x1, x2 0.
Plot the feasible zone of solutions. Is this zone a convex set?

Q.2. Minimize z = 3x1 + x2 15

Subject to: x1 + x2 1
x1 + 3x2 2
and x1, x2 0.
Solve the above LPP by dual simplex method

Q.3 A project consists of six activities of which details are given below 15
Activity A B C D E F G
Days 7 5 6 6 4 8 3
Pre-activity None A B,G C,F A E E
a. Identify critical path. What is time required to complete the project?
b. Compute total float, free floats for all the operations.
c. If activity F can be shortened by 2 days and B by 1 day, how would this
affect the completion date of the project.
 2

Q.4 The unit costs of transportation from various sources to destinations are given 15
below. The demand/supply of all the destinations/sources are also shown.
Find the initial solution by Vogels approximation method and obtain optimal
solution.
To
D E F Supply
Cij
A 6 8 4 14
B 4 9 8 12
From
C 1 2 6 5
Demand 6 10 15

Q.5 a The following table lists down the cost of assigning jobs to various workers.
Decide the optimal allocation of jobs assuming that only one job will be 5
assigned to each worker. Also formulate the above as linear programming
problem.
Worker
Cij A B C
1 120 100 80
2 80 90 110
Job

3 110 140 120

b The distances between various places in km are listed below. 10

Route 1-2 1-3 2-3 2-4 3-4 4-5 3-5
km 60 50 40 30 20 10 70
Draw the network of routes and find out the shortest route from 1 to 5.
************