Operations Research

10CS661

Assignment Questions
UNIT -1: Introduction, Linear programming-1
1. What is operations research? Mention six phases of the operations research study?
2. Define
i)
Feasible solution
ii)
Feasible region
iii)

Optimal solution

3. Define
i)

Feasible solution

ii)

Infeasible solution

iii)

Feasible region

iv)

Optimal Solution

v)
CPF solution
4. Define the term operations research and discuss its applications.
5. What are the steps/phases involved in operations research? explain in brief
6. Give the characteristics/Nature of operations research.
7. What are the advantages and limitations of operations research?
8. What is meant by Linear Programming? Give the formulation of an LPP.
9. Explain the mathematical formation of linear programming problems.
10. Explain the steps involved in graphical method of solving a LPP
11. Using the graphical method solve the LPP
12. Maximize Z=5x1 + 4x2
Subject to 6x1 + 4x2 < 24
x 1 + 2x2 < 6
-x1 + x2 < 1

x2<

2 and x1,x2 > 0

13. Using the graphical method solve the LPP Maximize Z=3x1 + 5x2 Subject to 3x1 +
2x2 < 18 x 1 < 4
2x1 < 12
And x1, x2 > 0

UNIT 2: LP 2, Simplex Method 1

1. Write six key solution concepts of simplex method.
DEPT. OF CSE, SJBIT

Operations Research

10CS661

2. Write four assumptions of linear programming.

3. Define slack variable and surplus variable
4. Mention the limitations of the graphical method used to solve a LPP.
5. Define
i)

Basic solution.

ii)

Basic feasible
solution. iii)
Optimal solution.
iv) In feasible solution

v)

Unbounded solution

6. Give the characteristics of LPP.

7. List the assumptions in LPP.
8. List the steps of simplex method in brief
9. How do you break the tie in simplex method? Write the steps used in resolving the
degeneracy in LPP.
10. Using the simplex method of tabular form solve the LPP
Maximize Z=4x1 + 3x2 + 6x3
Subject to 2x1 + 3x2 + 2x3 < 440
4x 1 + 3x2 < 470
2x1 + 5x2 < 430
and x1,x2,x3 > 0
11. Find all the basic solution of the following systems of equations identify in each
12. case the basic and non-basic variables. 2x1 + x2 + 6x3 =11 3x1 + x2 + 5x3 =14

UNIT 3: Simplex Method 2

1. Using Big M method solve the following:
a. Minimize Z=3x1 + 2x2 + x3
b. Subject to x 1 + x2 = 7
c. 3x1 + x2 + x3> 10 and x1 > 0, x2 >0, x3 > 0
2. Using the two-phase method solve the LPP
a. Maximize Z=7.5x1 - 3x2

DEPT. OF CSE, SJBIT

Operations Research

10CS661

b. Subject to 3x1 -x2 -x3 > 3

c. x 1 -x2+x3 > 2
d. and x1,x2,x3 > 0
3. Using Big M method solve the following:
a. Minimize Z=2x1 + x2
b. Subject to 3x 1 + x2 = 3
c. 4x1 +3 x2 > 6, x1 + 2x2 < 3
d. and x1 > 0, x2 >0 .
4. Briefly explain the post optimality analysis.
5. Write note on
a. Computer Implementation.
b. Foundation of the Simplex Method.

UNIT 4: Simplex Method 2, Duality Theory

1. Explain
a. Weak duality property
b. Strong duality property
c. Complementary solution property
2. Explain key relations between primal and dual problems
3. Explain the steps used in the revised simplex method.
4. Briefly explain the economic interpretation of duality
5. Use Revised Simplex Method to solve the LPP
Maximize Z=3x1 + x2
Subject to 3x1 + 2x2 < 18
2x1<4
2x2 < 12 And x1, x2 > 0
6. Define duality in LPP and write important characteristics of it.
7. Write the dual of the following: Maximize Z=6x1 + 10x2 Subject to 3x1 + 2x2 < 18 x
1 < 14
x2 < 16
3x1 + 2x2 < 18 and x1, x2 > 0
8. Using revised simplex method solve the following:
Minimize Z=4x1 + 3x2 + 6x3
DEPT. OF CSE, SJBIT

Operations Research

10CS661

Subject to 3 x 1 + x2+3x3 < 30

2 x 1 +2 x2+3x3 < 40 and x1
> 0, x2 >0, x3 > 0
9. Use revised simplex method to solve the following LPP
Maximize Z=x1 + 2x2
Subject to x1 + x2 < 3
x1 + 2x2 < 5
3x1 + x2 < 6 , x1, x2 > 0

UNIT 5: Duality Theory and Sensitivity Analysis, Other Algorithms for LP

1. Write the dual of the following LPP (4 marks)
Max Z=x1 + 2x2 + x3
Subject to 2 x 1 + x2 - x3 < 2
-2 x 1 + x2 - 5x3 > -6
4 x 1 + x2+x3 < 6 and x1 > 0, x2 >0, x3 > 0
2. Write a note on primal dual relationship.
3. Explain the role of duality in sensitivity analysis
4. Write a note on essence of sensitivity analysis.
5. Explain the procedure of Dual simplex method
6. Briefly explain the parametric linear programming and integer programming
7. Explain upper bound technique used to solve a LPP
8. Use the dual simplex method to solve the following problem
9. Maximize Z= -2x1 - 3x2
Subject to x1 + x2 > 2
2x1 + x2 < 10 x1 +
x2 < 8 x1, x2 > 0

UNIT 6: Transportation and Assignment Problems

1. Difference between Transportation and assignment problem
2. Define Basic Feasible Solution and optimal solution
3. What is Unbalanced Transportation problem? How do you solve it?

DEPT. OF CSE, SJBIT

Operations Research

10CS661

4. What is degeneracy in transportation problem? How do you resolve it?

5. List and explain the variations in transportation problem?
6. Explain the Hungarian method to solve an assignment problem.
7. List and explain the variations in assignment problem.
8. Write a note on solving procedure of a maximization problem.
9. Write different steps in the Hungarian algorithm to solve an assignment problem

UNIT 7: Game Theory, Decision Analysis

1. List and explain the basic terms used in Game Theory.
2. Explain two person zero-sum game with a suitable example.
3. Explain the properties of game?
4. Explain minimax and maximin principle
5. Define saddle point and value of game
6. Explain the concept of the dominance
7. Explain the following
a. Saddle point
b. Mixed strategy
8. Explain the following terms
i.Strategy ii.Fair
game iii.Zero
sum game iv.Nperson game
v.Non zero sum game
vi.Infinite game
vii.Payoff matrix
9. Explain the graphical method of solving 2*M and N*2 games.
10. Explain the role of linear programming in solving a game theory problem.
11. Briefly explain decision trees
12. Four jobs are to be done on four different machines. The cost (in rupees) of producing
ith job on the jth
Machine is give below

DEPT. OF CSE, SJBIT

Operations Research

10CS661

Assign the jobs for different machines so as to minimize the total cost

UNIT 8: Metaheuristics
1. Give note on outline of a basic genetic Algorithm
2. Give a note on outline of a Basic Simulated Annealing Algorithm.
3. Explain briefly:
a. Metaheyristics, its nature, advantage and disadvantage.
b. Tabu search algorithm
c. Simulated annealing algorithm.
d. Genetic algorithm.

DEPT. OF CSE, SJBIT