mhrd logo inflibnet logo ugc logo

Module Details

Course : P-14.operations Research

Subject : Mathematics

No. of Modules : 70

Level : PG

Source : E-PG Pathshala

Back

Sr. No. Title E-Text Video URL Metadata
1 M-01. linear programming problem: mathematical formulation of lpp and graphical method for solving lpp - Click Here
2 M-02. linear programming problem: simplex method for solving lpp and big-m method - Click Here
3 M-09. game theory: basic concept and terminologies, two-person zero-sum game, and game with pure and mixed strategies - Click Here
4 M-10. game theory: dominance principle, arithmetic method, and graphical method for solving a (2xn) game - Click Here
5 M-06. transportation and assignment problems: mathematical formulation and initial bfs of transportation problem - Click Here
6 M-11. game theory: graphical method for solving a (mx2) game and solution of a game by simplex method - Click Here
7 M-07. transportation and assignment problems: optimality test by stepping stone method and modi method, and some special cases of transportation problem - Click Here
8 M-04. linear programming problem: duality and solving lpp using duality in simplex method - Click Here
9 M-08. transportation and assignment problems: assignment problem and its solution by hungarian method, and travelling salesman problem - Click Here
10 M-05. linear programming problem: dual simplex method and revised simplex method - Click Here
11 M-03. linear programming problem: some special cases in lpp - Click Here
12 M-20.probabilistic model with uniform demand and no set up cost, and buffer stock in probabilistic inventory model - Click Here
13 M-12.basic terminologies and assumptions of job sequencing, and processing of n jobs through 2 and 3 machines - Click Here
14 M-19. newsboy problem and probabilistic inventory model with instantaneous demand and no set up cost - Click Here
15 M-13.processing n jobs through m machines, and processing 2 jobs through m machines - graphical method - Click Here
16 M-18.multi-item inventory models, purchase inventory model and inventory models with price breaks - Click Here
17 M-15.selection of the best machine, and individual and group replacement policies - Click Here
18 M-14.introduction to replacement theory and determination of optimal replacement time - Click Here
19 M-17.eoq with shortage and epq models with and without shortages - Click Here
20 M-16.economic order quantity and eoq model without shortage - Click Here
21 M-21. basic characteristics of queueing system and probability distribution of arrivals - Click Here
22 M-26. total float and free float of activity, and cpm model: time-cost optimization - Click Here
23 M-22. probability distribution of departures and model (m|m|1):(|fcfs) - Click Here
24 M-24. model iii - (m|m|s): (|fcfs), and model iv - (m|ek|1): ( |fcfs) - Click Here
25 M-23. model i. (general): (m|m|1): (|fcfs), and model ii. (m|m|1): (n|fcfs) - Click Here
26 M-25. basic components of network and critical path method (cpm) - Click Here
27 M-27. program evaluation and review technique (pert) - Click Here
28 M-29. basic concept and terminology, and dynamic programming models i and ii - - Click Here
29 M-28.lp and dual lp solutions to network problem - Click Here
30 M-31. introduction to integer programming and gomory's cutting plane method for all ipp - Click Here
31 M-34. nlpp with inequality constraints: kuhn-tucker conditions, and quadratic programming - Click Here
32 M-32. gomory's cutting plane method for mixed ipp, and branch and bound method - Click Here
33 M-30. dp model iii, solution of discrete dp problem and solution of lpp by dp - Click Here
34 M-33. nlpp with equality constraints: lagrange multiplier method - Click Here
35 M-35. wolfe's modified simplex method and beale's method - Click Here
36 M-06. transportation and assignment problems: mathematical formulation and initial bfs of transportation problem - Click Here
37 M-01. linear programming problem: mathematical formulation of lpp and graphical method for solving lpp - Click Here
38 M-04. linear programming problem: duality and solving lpp using duality in simplex method - Click Here
39 M-02. linear programming problem: simplex method for solving lpp and big-m method - Click Here
40 M-05. linear programming problem: dual simplex method and revised simplex method - Click Here
41 M-03. linear programming problem: some special cases in lpp - Click Here
42 M-09. game theory: basic concept and terminologies, two-person zero-sum game, and game with pure and mixed strategies - Click Here
43 M-10. game theory: dominance principle, arithmetic method, and graphical method for solving a (2xn) game - Click Here
44 M-11. game theory: graphical method for solving a (mx2) game and solution of a game by simplex method - Click Here
45 M-07. transportation and assignment problems: optimality test by stepping stone method and modi method, and some special cases of transportation problem - Click Here
46 M-08. transportation and assignment problems: assignment problem and its solution by hungarian method, and travelling salesman problem - Click Here
47 M-12.basic terminologies and assumptions of job sequencing, and processing of n jobs through 2 and 3 machines - Click Here
48 M-13.processing n jobs through m machines, and processing 2 jobs through m machines - graphical method - Click Here
49 M-15.selection of the best machine, and individual and group replacement policies - Click Here
50 M-14.introduction to replacement theory and determination of optimal replacement time - Click Here
51 M-20.probabilistic model with uniform demand and no set up cost, and buffer stock in probabilistic inventory model - Click Here
52 M-19. newsboy problem and probabilistic inventory model with instantaneous demand and no set up cost - Click Here
53 M-18.multi-item inventory models, purchase inventory model and inventory models with price breaks - Click Here
54 M-21. basic characteristics of queueing system and probability distribution of arrivals - Click Here
55 M-22. probability distribution of departures and model (m|m|1):(|fcfs) - Click Here
56 M-24. model iii - (m|m|s): (|fcfs), and model iv - (m|ek|1): ( |fcfs) - Click Here
57 M-23. model i. (general): (m|m|1): (|fcfs), and model ii. (m|m|1): (n|fcfs) - Click Here
58 M-17.eoq with shortage and epq models with and without shortages - Click Here
59 M-16.economic order quantity and eoq model without shortage - Click Here
60 M-31. introduction to integer programming and gomory's cutting plane method for all ipp - Click Here
61 M-26. total float and free float of activity, and cpm model: time-cost optimization - Click Here
62 M-32. gomory's cutting plane method for mixed ipp, and branch and bound method - Click Here
63 M-30. dp model iii, solution of discrete dp problem and solution of lpp by dp - Click Here
64 M-33. nlpp with equality constraints: lagrange multiplier method - Click Here
65 M-25. basic components of network and critical path method (cpm) - Click Here
66 M-27. program evaluation and review technique (pert) - Click Here
67 M-29. basic concept and terminology, and dynamic programming models i and ii - - Click Here
68 M-28.lp and dual lp solutions to network problem - Click Here
69 M-34. nlpp with inequality constraints: kuhn-tucker conditions, and quadratic programming - Click Here
70 M-35. wolfe's modified simplex method and beale's method - Click Here