Theoretical questions of operations research.pptx
- 2. Basic Concepts of LPP • Objective Function • Constraints • Non-negative restrictions • Feasible region • Optimal Solution
- 4. Assumptions of Linear Programmin • Linearity • Additivity-The value of the objective function for the given values of the decision variables and total sum of resources used must be equal to the sum of the contributions (profit or costs) earned from each decision variables. Examples:-X1=6, X2=3 and Z=15, Obj Fn max Z=2X1+X2, values of X1 and X2 must satisfy the objective function Z. • Divisibility • Certainity • Non-Negative Variables
- 7. Difference between Slack, Surplus and Artificial Variables
- 8. Difference between NWCM/LCM/VAM NWCM LCM VAM ALLOCATIONS ARE MADE TO THE TOP LEFT CORNER Allocations are made to the Least cost cell depending upon supply and demand. Allocations are made corresponding to the maximum penalty calculated (Row and Column) Simplest Method If Least cost holds for two cells, select the cell with maximum allocation and if, allocations are same, select any cell arbitrarily. If maximum penalty is same, select penalty with least cost. And if, least cost is same then select that cell, corresponding to which there is maximum allocation. If allocations are same, select arbitrarily any cell. Maximum total cost Cost less than NWCM, more than VAM Total Cost is Less than NWCM and VAM
- 10. Monte – Carlo Simulation • Formulation of an Appropriate Model • Computation of Cumulative Probability Distribution • Setting of Ranom Number Intervals • Selection of Suitable Random Numbers • Testing • Examine the results
- 11. Limitations of Simulation • All situations cannot be evaluated with simulation • Time consuming • Does not create the solution techniques • Not possible to quantify all the variables • Long, complicated and expensive technique