IV - AIDS Group - C (Assignment - 1)
IV - AIDS Group - C (Assignment - 1)
2 732721243036 Prabhu S
3 732721243038 Roshan AK
4 732721243040 Sangameswaran P
5 732721243041 Santhosh P
6 732721243042 Saranya V
8 732721243044 Shalini M
9 732721243045 Sharique M
11 732721243048 Sowndharrajan M
12 732721243056 Vikram M
13 732721243058 Vimalkumar R
14 732721243059 Yaswanth K
COURSE CODE / COURSE NAME: OIE352 / RESOURCE MANAGEMENT
TECHNIQUES
IV-AIDS_GROUP –C (ASSIGNMENT – 1)
PART –A
1. State the algorithm for graphical method
2. Define following terms (a) Solution (b) Feasible Solution
3. Explain slack variables of LP problems
4. Explain slack surplus variable and artificial variable of LP problems.
5. What is dual simplex method?
6. What are the characteristics of a primal and dual problem?
7. State the necessary and sufficient condition for a transportation problem to have a solution
8. What do you understand by Assignment Problem?
9. Why integer programming is needed? Generalize it.
10. Write down the methods for solving integer programming problem
PART –B
1. Solve the following LP problem using graphical method
Maximize Z 3x1 2 x2
subject to 2 x1 x2 1; x1 2 ; x1 x2 3 x1 and x2 0
2. Solve the following LPP using graphical method
Minimize Z 3x1 5 x2
subject to 3x1 4 x2 12; x1 4; 2 x1 x2 2;
x2 2; 2 x1 3x2 12 and x1 , x2 0
3. Solve the following LPP using simplex method
Maximize Z 10 x1 15 x2 20 x3
subject to 2 x1 4 x2 6 x3 24; 3x1 9 x2 6 x3 30 and x1 , x2 , x3 0
4. Solve the following LPP by simplex method
Minimize Z x2 3x3 2 x5
subject to 3x2 x3 2 x5 7; 2 x2 4 x3 12; 4 x2 3 x3 8 x5 10;
x1 , x2 and x3 0
5. Use dual simplex method to solve the LPP
Maximize Z 3x1 2 x2
subject to
x1 x2 1; x1 x2 7; x1 2 x2 10; x2 3 and x1 , x2 0
6. Use dual simplex method to solve the LPP
Minimize Z 2 x1 4 x2
subject to
2 x1 x2 4; x1 2 x2 3; 2 x1 2 x2 12 and x1 , x2 0
7. Solve the transportation problem:
A B C D Supply
I 11 20 7 8 50
II 21 16 20 12 40
III 8 12 18 9 70
Demand 30 25 35 40
8. A dairy firm has three plants located in a state. The daily milk production at each plant
is as follows: Find the initial basic feasible solution for this problem by
(a)North West method (b) Least cost method (c) VAM
1 2 3 4 Supply
I 3 1 7 4 300
II 2 6 5 9 400
III 8 3 3 2 500
Demand 250 350 400 200 1200
9. Solve the assignment problem for maximization given the profit matrix (profit in rupees)
Machines
P Q R S
A 60 50 40 30
Job B 40 30 20 15
C 40 20 35 10
D 30 30 25 20
10. Find the optimum integer solution to the following integer programming problem:
Minimize Z 2 x1 3x2
subject to 2 x1 2 x2 7; x1 2; x2 11; x1 , x2 0 and are int egers.
11. Solve the following mixed integer programming problem by Gomory’s cutting plane
algorithm:
Maximize Z x1 x2
subject to 2 x1 5 x2 16
6 x1 5 x2 30
x1 , x2 0 and x1 an non negative int eger.