Operation Research Tuition In Noida with 100% Results, RESOURCE SCHEDULING AND NETWORK ANALYSIS Problem of sequencing – Sequencing n jobs through 2 machines and 3 machines, 2 jobs through m machines.
PERT and CPM –Critical path calculation – Probability and cost consideration. REPLACEMENT AND GAME THEORY Replacement Models – Replacement of items that deteriorate with time – Equipment that fails suddenly. Two person
zero sum games – Pure strategies and saddle point – Mixed strategies – 2 x n and m x 2 games – Method of dominance
– Numerical and graphical solutions. INVENTORY CONTROL Inventory models – Deterministic models – Economic ordering quantity, Reorder level, optimum cost – Instantaneous
and Non-instantaneous receipt of goods with or without shortages. LINEAR PROGRAMMING Introduction to Linear Programming – Formulation of the problem – Graphical method – Simplex method – Artificial
variable techniques - Primal-dual problems – Dual Simplex method. ADVANCED LINEAR PROGRAMMING PROBLEMS Integer programming problem - Cutting plane algorithm – Transportation models - Vogel's Approximation method –
MODI method – Unbalanced transportation problem – Degeneracy in transportation models – Assignment models –
Traveling salesman problem-Dynamic Programming problem. Online Class available, Backlogs Reappear BTech Tuition Class Call 9818003202
PERT and CPM –Critical path calculation – Probability and cost consideration. REPLACEMENT AND GAME THEORY Replacement Models – Replacement of items that deteriorate with time – Equipment that fails suddenly. Two person
zero sum games – Pure strategies and saddle point – Mixed strategies – 2 x n and m x 2 games – Method of dominance
– Numerical and graphical solutions. INVENTORY CONTROL Inventory models – Deterministic models – Economic ordering quantity, Reorder level, optimum cost – Instantaneous
and Non-instantaneous receipt of goods with or without shortages. LINEAR PROGRAMMING Introduction to Linear Programming – Formulation of the problem – Graphical method – Simplex method – Artificial
variable techniques - Primal-dual problems – Dual Simplex method. ADVANCED LINEAR PROGRAMMING PROBLEMS Integer programming problem - Cutting plane algorithm – Transportation models - Vogel's Approximation method –
MODI method – Unbalanced transportation problem – Degeneracy in transportation models – Assignment models –
Traveling salesman problem-Dynamic Programming problem. Online Class available, Backlogs Reappear BTech Tuition Class Call 9818003202
No comments:
Post a Comment