CS6704 Important Questions Resource Management Techniques
CS6704 Important Questions Resource Management Techniques Regulation 2013 Anna University free download. Resource Management Techniques CS6704 Important Questions pdf free download.
Sample CS6704 Important Questions Resource Management Techniques:
1. What is linear programming?
Linear programming is a technique used for determining optimum utilization of limited resources to meet out the given objectives. The objective is to maximize the profit or minimize the resources (men, machine, materials and money)
2. Write the general mathematical formulation of LPP. CS6704 Important Questions Resource Management Techniques
1. Objective function
3. What are the characteristic of LPP? CS6704 Important Questions Resource Management Techniques
There must be a well defined objective function.
There must be alternative course of action to choose.
Both the objective functions and the constraints must be linear equation or inequalities.
4. What are the characteristic of standard form of LPP? CS6704 Important Questions Resource Management Techniques
The objective function is of maximization type.
All the constraint equation must be of equal type by adding slack or surplus variables
RHS of the constraint equation must be positive type
All the decision variables are of positive type
5. What are the characteristics of canonical form of LPP? (NOV ’07) CS6704 Important Questions Resource Management Techniques
In canonical form, if the objective function is of maximization type, then all constraints are of ≤ type. Similarly if the objective function is of minimization type, then all constraints are of ≥ type. But non-negative constraints are ≥type for both cases. CS6704 Important Questions Resource Management Techniques
6. A firm manufactures two types of products A and B and sells them at profit of Rs 2 on type A and Rs 3 on type B. Each product is processed on two machines M1 and M2.Type A requires 1 minute of processing time on M1 and 2 minutes on M2 Type B requires 1 minute of processing time on M1 and 1 minute on M2. Machine M1 is available for not more than 6 hours 40 minutes while machine M2 is available for 10 hours during any working day. Formulate the problem as a LPP so as to maximize the profit. (MAY ’07)
Maximize z =2×1 +3×2
Subject tot the constraints:
x1 + x2 ≤ 400
2×1 + x2 ≤ 600
x1 ,x2≥ 0 CS6704 Important Questions Resource Management Techniques
| Subject Name | Resource Management Techniques |
| Subject code | CS6704 |
| Regulation | 2013 |
CS6704 Important Questions RMT Resource Management Techniques click here to download
CS6704 Syllabus Resource Management Techniques
CS6704 Notes Resource Management Techniques