Lec-3 Graphical Method | Linear Programming Problem | Unbounded Solution | Operations Research

This is Lecture-3 on the Operations Research video series. In this lecture, we will learn the Graphical Method. We can Solve any Linear Programming Problem using the Graphical Method if there are two decision variables in that problem.
As we have discussed in previous lectures, we usually get to see Four types of cases in Graphical Method:
1. A unique optimal Solution
2. An infinite number of optimal solutions
3. An unbounded Solution
4. No Solution
In lecture-1 and lecture-2, we discussed how to solve and get a unique optimal solution, and an infinite number of optimal solution for a linear programming problem using graphical method:
So, in this lecture-3, we will solve a Linear Programming Problem example using the Graphical Method for an Unbounded optimal solution.

[VK]

fantastic way of teaching, keep up the good work