Can u please suggest any good online classes for operation research for CA final !!!
Mechanical - Fundamentals of Operations Research - YouTube
► Play all
WATCHED
|
Lec-1 Introduction to Linear Programming Formulations | nptelhrd |
51:48
|
||||
|
Lec-2 Linear Programming Formulations (Contd...) | nptelhrd |
52:08
|
||||
|
Lec-3 Linear Programming Solutions- Graphical Methods | nptelhrd |
52:11
|
||||
|
Lec-4 Linear Programming Solutions - Simplex Algorithm | nptelhrd |
51:30
|
||||
|
Lec-5 Simplex Algorithm-Minimization Problems | nptelhrd |
52:11
|
||||
|
Lec-6 Simplex Algorithm - Initialization and Iteration | nptelhrd |
52:25
|
||||
|
Lec-7 Simplex Algorithm - Termination | nptelhrd |
51:37
|
||||
|
Lec-8 Introduction to Duality | nptelhrd |
51:03
|
||||
|
Lec-9 Primal Dual Relationships, Duality Theorems | nptelhrd |
51:37
|
||||
|
Lec-10 Dual Variables and the Simplex Tables | nptelhrd |
51:37
|
||||
|
Lec-11 Simplex Algorithm in Matrix Form - Sensitivity Analysis | nptelhrd |
1:01:37
|
||||
|
Lec-12 Sensitivity Analysis Transportation Problem (Intro...) | nptelhrd |
1:01:47
|
||||
|
Lec-13 Transportation Problems | nptelhrd |
1:00:49
|
||||
|
Lec-14 Transportation Problem-Optimal Solutions | nptelhrd |
1:01:08
|
||||
|
Lec-15 Transportation Problem-Other Issues | nptelhrd |
1:01:41
|
||||
|
Lec-16 Assignment Problem - Hungarian Algorithm | nptelhrd |
1:00:16
|
||||
|
Lec-17 Other Issues - Introduction to Dynamic Programming | nptelhrd |
1:01:50
|
||||
|
Lec-18 Dynamic Programming - Involving Discrete Variables | nptelhrd |
54:26
|
||||
|
Lec-19 Dynamic Programming - Continuous Variables | nptelhrd |
59:09
|
||||
|
Lec-20 Dynamic Programming - Linear and Integer Problems | nptelhrd |
1:00:51
|
||||
|
Lec-21 Inventory Models - Deterministic Models | nptelhrd |
1:01:04
|
||||
|
Lec-22 Inventory Models - Discount Models | nptelhrd |
1:00:51
|
Mechanical - Advanced Operations Research - YouTube
► Play all
WATCHED
|
Lec-1 Introduction and Linear Programming | nptelhrd |
1:02:27
|
||||
|
Lec-2 Revised Simplex Algorithm | nptelhrd |
57:53
|
||||
|
Lec-3 Simplex Method for Bounded Variables | nptelhrd |
49:30
|
||||
|
Lec-4 One Dimensional Cutting Stock Problem | nptelhrd |
58:35
|
||||
|
Lec-5 One Dimensional Cutting Stock Problem(Contd) | nptelhrd |
58:20
|
||||
|
Lec-6 Dantzig-Wolfe Decomposition Algorithm | nptelhrd |
58:38
|
||||
|
Lec-7 Dantzig-Wolfe Decomposition Algorithm Primal-Dual Algorithm | nptelhrd |
57:08
|
||||
|
Lec-8 Primal-Dual Algorithm | nptelhrd |
57:37
|
||||
|
Lec-9 Goal Programming-Formulations | nptelhrd |
50:12
|
||||
|
Lec-10 Goal Programming Solutions Complexity of Simplex Algorithm | nptelhrd |
49:12
|
||||
|
Lec-11 Complexity of Simplex Algorithm(Contd) Integer Programming | nptelhrd |
50:36
|
||||
|
Lec-12 Integer Programming-Formulations | nptelhrd |
50:50
|
||||
|
Lec-13 Solving Zero-One Problems | nptelhrd |
49:05
|
||||
|
Lec-14 Solving Zero-One Problems(Contd) | nptelhrd |
49:09
|
||||
|
Lec-15 Branch And Bond Algorithm For Integer Programming | nptelhrd |
47:50
|
||||
|
Lec-16 Cutting Plane Algorithm | nptelhrd |
48:39
|
||||
|
Lec-17 All Integer Primal Algorithm | nptelhrd |
50:38
|
||||
|
Lec-18 All Integer Dual Algorithm | nptelhrd |
50:48
|
||||
|
Lec-19 Network Models | nptelhrd |
58:16
|
||||
|
Lec-20 Shortest Path Problem | nptelhrd |
58:04
|
||||
|
Lec-21 Successive Shortest Path Problem | nptelhrd |
58:35
|
||||
|
Lec-22 Maximum Flow Problem | nptelhrd |
58:21
|
||||
|
Lec-23 Minimum Cost Flow Problem | nptelhrd |
58:32
|
||||
|
Lec-24 Traveling Salesman Problem(TSP) | nptelhrd |
58:30
|
||||
|
Lec-25 Branch and Bound Algorithms for TSP | nptelhrd |
58:06
|
||||
|
Lec-26 Heuristics for TSP | nptelhrd |
58:08
|
||||
|
Lec-27 Heuristics for TSP(Contd) | nptelhrd |
57:55
|
||||
|
Lec-28 Chinese Postman Problem | nptelhrd |
58:23
|
||||
|
Lec-29 Vehicle Routeing Problem | nptelhrd |
59:08
|
||||
|
Lec-30 Queueing Models | nptelhrd |
58:33
|
||||
|
Lec-31 Single Server Queueing Models | nptelhrd |
56:56
|
||||
|
Lec-32 Multiple Server Queueing Models | nptelhrd |
56:13
|
||||
|
Lec-33 Game Theory | nptelhrd |
58:36
|
||||
|
Lec-34 Critical Path Method | nptelhrd |
57:56
|
||||
|
Lec-35 Quadratic Programming | nptelhrd |
52:07
|
||||
|
Lec 36 - Integer Programming(continued) | nptelhrd |
51:02
|
||||
|
Lec 37 - All Integer Dual Algorithm | nptelhrd |
51:10
|
||||
|
Lec 38 - Mixed Integer Linear Programming | nptelhrd |
51:43
|
||||
|
Lec 39 - Benders Partitioning Algorithm | nptelhrd |
50:24
|
PLEASE WATCH ONLY THOSE VIDEOS WHICH ARE RELEVANT FOR CA FINAL.
KEEP DEATAILED SYLLABUS IN HAND BEFORE WATCHING THESE VIDEOS.
SOME CHAPTERS ARE MISSING BUT MAJORITY OF OPERATION RESEARCH FOR PAPER 5 IS COVERED FANTASTICALLY.
Your are not logged in . Please login to post replies
Click here to Login / Register
Shyam Joshi & Associates
Pune
B.Com
View Details
Karia Overseas
Ahmedabad
CA
View Details
T R SOOD & CO
New Delhi
CA Inter
View DetailsIndia's largest network for
finance professionals