The Big- M Method:The Big- M Method Minimization case: Solving Simplex Linear Programming problem
In this video, I have explained solving Linear Programming Problem using Big M Method in a simple and easy way with Minimization case.
The main aim of these series of videos is to make clear the fundamentals of Operation Research and its techniques used in different fields of Interest.
It takes around 18 hours of time to prepare a video which you are seeing now. Please subscribe for more videos in this series.
If this video is useful, please press like button and share the video.
This video is a part of “Operations Research” series and you can watch the videos in the following links.
► Operations Research Play List: ✔
[ Ссылка ]
In this series, I have explained the following topics
► Introduction to Operations Research ✔
[ Ссылка ]
►Linear Programming problem✔
[ Ссылка ]
►Graphical Method Introduction ✔
[ Ссылка ]
►Linear Programming Problem: Graphical Method: Example on Minimization LP Problem ✔
[ Ссылка ]
►LPP Graphical Method: Example on Mixed Constraints LP Problem ✔
[ Ссылка ]
►Linear Programming problem: Graphical Method, Maximization Problem ✔
[ Ссылка ]
►Linear Programming using Graphical Method Iso-Profit function Line approach ✔
[ Ссылка ]
►Linear Programming: Graphical Method- Iso-Profit function with Maximization Case✔
[ Ссылка ]
►Linear Programming: Graphical Method- Iso-Profit line using Minimization Case ✔
[ Ссылка ]
►Introduction to Simplex Method✔
[ Ссылка ]
►LPP using Simplex method: How to solve LPP using Simplex Method in a easy way? ✔
[ Ссылка ]
►Linear programming simplex method Minimization problems with solutions ✔
[ Ссылка ]
►LPP big m method - minimization in operations research with solved problem easy to understand ✔
[ Ссылка ]
►LPP - Big M Method Maximization case - simple and very easy way to understand ✔
[ Ссылка ]
You may be interested in other series of videos:
► Multivariate Data Analysis Using SPSS ✔
[ Ссылка ]
►Structural Equation Modeling using SPSS Amos ✔
[ Ссылка ]
►Non Parametric Test using SPSS ✔
[ Ссылка ]
►Parametric test using SPSS ✔
[ Ссылка ]
►Basics of SPSS Statistics ✔
[ Ссылка ]
►Statistical Analysis using PSPP software ✔
[ Ссылка ]
►Cluster Analysis using SPSS ✔
[ Ссылка ]
In this series, I have explained the following topics
1. Introduction to Operation Research.
2. Linear and Non-Linear Integer, Goal and Dynamic Programming Problems
3. Linear Programming Problems [LPP] LPP Mathematical Model
4. Formulation of LPP, Assumptions underlying LPP
5. LPP Graphical Method Introduction
6. LPP Graphical Method Extreme endpoint method
7. LPP Graphical Method Iso-Profit line method
8. LPP Simplex Method Introduction
9. LPP using Simplex Method Maximization case
10. LPP using Simplex Method Minimization Case
11. Dual formulation Problems
12. LPP Big M Method
13. Two-Phase Simplex Method
14. Degeneracy Problem in Simplex Method
15. Sensitivity Analysis
16. Transportation Problems Mathematical model
17. IBFS using Northwest Corner Method
18. Least Cost Method [LCM] in Transportation problems
19. Vogel’s Approximation Method [VAM]
20. MODI U V Method for Optimality test
21. Assignment Problems [AP]
22. Unbalanced AP
23. Travelling Salesman Problem
24. Networking Fundamentals-Scheduling the activities
25. Fulkerson’s Rule -CPM
26. Determination of ES and EF in the Forward Pass
27. LS and LF in backward pass
28. Determination of Critical path,
29. Time cost trade off
30. PERT Beta distribution
31. Queuing Theory -Concepts of Queue/Waiting line
32. Deterministic Queuing Models- Probability Queuing Models
33. Cost Analysis
34. Single Channel Queuing Model- Poisson Arrival- Exponential Model – Multi-server Model
35. Game Theory – Concepts Saddle Points
36. Dominance, Zero sum game
