LPP(Big M Method) Simplex problem maximization case with solved problem :- by G N Satish Kumar

The Big- M Method Maximization 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 Maximization 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: ✔
   • Graphical Method Introduction  

In this series, I have explained the following topics

► Introduction to Operations Research ✔
   • Introduction to Operations Research:-...  

►Linear Programming problem✔
   • Linear programming model formulation ...  

►Graphical Method Introduction ✔
   • Graphical Method Introduction  

►Linear Programming Problem: Graphical Method: Example on Minimization LP Problem ✔
   • Linear Programming Problem: Graphical...  

►LPP Graphical Method: Example on Mixed Constraints LP Problem ✔
   • Linear Programming Problem: Graphical...  

►Linear Programming problem: Graphical Method, Maximization Problem ✔
   • Linear Programming problem: Graphical...  

►Linear Programming using Graphical Method Iso-Profit function Line approach ✔
   • Linear Programming using Graphical Me...  

►Linear Programming: Graphical Method- Iso-Profit function with Maximization Case✔
   • Linear Programming: Graphical Method-...  

►Linear Programming: Graphical Method- Iso-Profit line using Minimization Case ✔
   • Linear Programming: Graphical Method-...  

►Introduction to Simplex Method✔
   • Introduction to Simplex Method  

►LPP using Simplex method: How to solve LPP using Simplex Method in a easy way? ✔
   • LPP using Simplex method: How to solv...  

►Linear programming simplex method Minimization problems with solutions ✔
   • LPP Minimization problem ( Simplex pr...  

►LPP big m method - minimization in operations research with solved problem easy to understand ✔
   • LPP  (BIG M METHOD) Minimization case...  

►LPP - Big M Method Maximization case - simple and very easy way to understand ✔
   • LPP(Big M Method) Simplex problem max...  


You may be interested in other series of videos:

► Multivariate Data Analysis Using SPSS ✔
   • # Multinomial logistic regression usi...  

►Structural Equation Modeling using SPSS Amos ✔
   • Basics of  Structural Equation Modell...  

►Non Parametric Test using SPSS ✔
   • McNemar test in SPSS by G N Satish Kumar  

►Parametric test using SPSS ✔
   • One Way Anova Using SPSS by G N Satis...  

►Basics of SPSS Statistics ✔
   • Basics  of SPSS Part 1  

►Statistical Analysis using PSPP software ✔
   • Non Parametric test - Run Test with P...  

►Cluster Analysis using SPSS ✔
   • Hierarchical Cluster Analysis using S...  


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
37. Two, three and More Persons Games