PANIMALAR ENGINEERING COLLEGE

DEPARTMENT OF CSE
CS6704 Resource Management Techniques
Important Questions for Model Exam
PART A
Unit 1
1. What is slack variable?
2. What do you mean by shadow pricing
3. A company sells two different products A and B , making a profit of Rs.40 and Rs. 30 per
unit on them, respectively. They are produced in a common production process and are
sold in two different markets, the production process has a total capacity of 30,000 man-
hours. It takes three hours to produce a unit of A and one hour to produce a unit of B. The
market has been surveyed and company official feel that the maximum number of units of
A that can be sold is 8,000 units and that of B is 12,000 units. Subject to these limitations,
products can be sold in any combination. Formulate the problem as a LPP so as to
maximize the profit
4. How do you identify that LPP has no solution in a two-phase method
5. State the Limitations of LP
Unit 2
6. Define transportation problem
7. Write the steps in Dual Simplex method
8. Write the Mathematical Representation of Transportation Problem
9. What do you understand by degeneracy in a transportation problem
10. Demonstrate the conversion of an unbalanced transportation problem into a balanced
one?
Unit 3
11. What are the classifications of Integer Programming Problem(IPP)?
12. Write the Gomory’s constraint for the all Integer Programming problem whose simplex
table( with non integer solution) given below:

13. What is Dynamic programming?

14. Explain is cutting plane
15. State the importance of Integer Programming

Unit 4
16. Write down the lagrangian equation for Kuhn Tucker method for the following equation.
f(x) = 7x3 – 6x2 + 7x – 9 with constraint 5x2 - 4x< 3
17. Solve by using Newton Raphson Method f(x) = 6x5 – 4x3 + 10
18. Describe Newton-Raphson method
19. Examine f(x)=6x5 – 4x3 +10 for extreme points
20. Define the Jacobian matrix J and the control matrix C
Unit 5
21. If there are five activities P,Q,R,S and T such that P,Q,R have no immediate
predecessors but S and T have immediate predecessors P,Q and Q,R respectively.
Represent this situation by a network. [Create]
22. Distinction between PERT and CPM
23. Define the Fulkerson’s rule for numbering the events
24. Define pessimistic time estimate in PERT
25. Explain dangling in a network

PART B
Unit 1
1. Graphical method
2. Penalty method or Big M method
3. Two Phase method
Unit 2
4. Dual Simplex method
5. Transportation method
6. Assignment method
Unit 3
7. Gomory Cutting plane (All integer)
8. Gomory Cutting plane (Mixed integer)
9. Branch and bound
Unit 4
10. Kuhn-Tucker Conditions
11. Lagrangian multiplier method
12. Newton Raphson method
Unit 5
13. CPM
14. PERT
15. Resource Leveling