Master linear programming using graphical and simplex method

Have you ever wondered, how businesses make critical decisions when it comes to maximizing their profits or minimizing their costs? They do so through various means and one such means is through Operations Research. Hi, this is Madhusudan Sohani, Operations Consultant and Trainer and I welcome you all to this comprehensive course on Linear Programming. I have 45+ years of experience working as an industry leader and teaching operations research through various executive courses and programs to students all around the globe.

The course is designed to provide you with an opportunity to understand and solve linear programming problems. The course starts with the graphical method of solving the Linear Programming Problem (LPP), with a detailed explanation as to what is an LPP, and how to formulate it and solve it using a simple graph.

In the very First Lecture, I delved into the concept of LPP along with how and where it is to be applied. This lecture deals with plotting the constraints as straight lines in their limiting case and from thereupon finding the solution space. The first lecture has two problems solved in it whereas the Second Lecture solves four such problems. All types of problems have been covered, including the special case of three variable problem solved using the graphical method.

The next lecture, Lecture Number 3 is an important lecture in the sense that it introduces the student to the process of the simplex algorithm. Initially, a very simple problem involving two variables and two constraints has been solved using the simplex process. In the course of solving the problem, the method has been explained at length. The next simplex problem covered in the same lecture has three variables and three constraints.

The subsequent Lecture Number 4 deals with 3 variables, 3 constraints with multiple solutions. It will also train the student on how to detect multiple solutions. In this elaborate lecture, the second problem solved is by way of revision, and so are the next two, which are 3 variables, and 3 constraints problems. Later on, in the same lecture, degeneracy has been covered at length, by solving a problem twice for better understanding. Towards the end of the lecture, the concept of duality has been explained in detail.

In the 5th Lecture, an important topic of sensitivity analysis is taken in for discussion. It’s very important to discuss this topic to understand the simplex process completely and the “What If” situations in businesses where LPP is applied.

In Lecture Number 6, another simple problem on sensitivity analysis has been covered, apart from covering a problem on graphical method, just by way of revision.

Hey, I understand Linear Programming is a bit intimidating, but don’t worry, I have explained it with minimal arithmetic calculations using day-to-day examples so that even complex problems on simplex and graphical methods will seem like fun.

Don’t wait any further, enroll now, see you in the course.