Вы находитесь на странице: 1из 2

OPERATIONS RESEARCH

CT-4-BCA-601

Full Marks: 80
The figures in the margin indicate full marks for the questions
Answer Questions Nos. 1 and 2, and any six from the rest
1. State true or false 1 X 8 =8
a. What is simplex?
b. What is simple solution?
c. Define a convex set.
d. What is a surplus variable?
e. What is risk management?
f. Define a dynamic programming problem.
g. Define a queue.
h. Are the number of constrains in the primal and dual the same?
2. Answer the following 3 X 6 = 18
a. Give the general formulation of linear programming problem.
b. What is feasibility region? is it necessary that it should always be a convex set?
c. Express the following LPP in standard form
Minimize Z=x 1 -2x 1  x3
Subject to 2x 1 3 x 2  4 x3  4
3x 1 5 x 2  2 x3  7
x 1  0, x 2  0 and x 3 is unrestricted in sign
d. Write and discuss the three phases of the scientific method on which operation
Research is based.
e. With reference to the transportation problem, define the following terms.
(a) Feasible solution
(b) Basic feasible solution
(c) Optimal solution
f. Give the general mathematical model of linear programming problem.
3. A complete unit of a certain product consist of four units of component A and three 9
units of components B. The two components (A and B) are manufactured from two
different raw materials of which 100 units and 200 units respectively, are available.
Three departments are engaged in the production process with each department using a
different method for manufacturing the components for production run and the vaulting
units of each component are given bellow.

Input per run (units) Output per run (units)


Department Raw Material Raw Material Component Component
A B A B
1 7 5 6 4
2 4 8 5 8

3 2 7 7 3

4. Solve the following LPP by simplex method 9


Maximize Z=3x 1 2x 2
Subject to the constraints
x 1  x2  4
x 1 x 2  2
x 1 , x2  0
5. Solve the following LPP by two phase method 9
Minimize Z= x1 + x2
2x 1 4 x 2  4
x 1 7 x 2  7
and x 1, x 2  0
6. Solve the following LPP by Big M method 9
Minimize Z=5x 1 3x 2
Subject to the
2x 1 4 x 2  12
2x 1 2 x 2  10
5x 1 2 x 2  10
and x 1 , x2  0
7. Obtain an initial basic feasible solution to the following transportation problem by 9
Vogel’s method
Stores Availability
I II III IV
Ware A 7 3 5 5 34
house B 5 5 7 6 15
C 8 6 6 5 12
D 6 1 6 4 19
Demand 21 25 17 17
8. State the general rules for converting any primal LPP into its dual 9

9. Discuss the steps of North-West corner method and least cost method 9

10. Using North-West corner methos, find an initial basic feasible solution to the following 9
transportation problem :
To Supply
I II III
a 2 7 4 5
from b 3 3 1 8
c 5 4 7 7
d 1 6 2 14
Demand 7 9 18 34