Professional Documents
Culture Documents
Q.
Question CO PO
No
Q1 Explain the concept and computational steps of the simplex 1 1
method for a solving a maximization linear programming &
problem. 7
Q2 Write the dual of the following linear programming problem 2 1
Max Z = 10y1 +8y2 -6y3 &
Subject to 2
3y1 +y2 – 2y3 ≤ 10
-2y1 + 3y2 – y3 ≥ 12
y1, y2, y3 ≥ 0
Q3 Solve the following transportation problem using North-West 2 1
corner &
To P Q R S Supply 2
From
A 12 8 10 15 500
B 6 12 7 16 300
C 7 15 10 7 200
Demand 180 150 350 320
SECTION -B
Q. Question CO PO
No.
Q4 Write a short note on sensitivity analysis. And explain how a 2 2
change in the objective function coefficient can affect a problem’s
optimal solution.
Q5 A cement company has three factories which manufacture cement 2 2
which is then transported to four distribution centres. The quantity
of monthly production of each factory, the demand of each
distribution centre and the associated transportation cost per
quintal are given as follows:
Distribution centres Monthly
W X Y Z production
(in quintals)
A 10 8 5 4 7000
B 7 9 15 8 8000
C 6 10 14 8 10000
Monthly 6000 6000 8000 5000
Demand (in
quintals)
Find the initial basic solution using Least Cost Method.
Q6 Explain the procedure for solving the assignment problem using 2 2
Hungarian Method.