Lec-4 Graphical Method | Linear Programming Problem | No Feasible Solution | Operations Research

This is Lecture-4 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 the previous three lectures, we finished discussing the first three cases for unique optimal solution, an infinite number of optimal solution, and an unbounded optimal solution for a linear programming problem using graphical method. This is Lecture-4, the last lecture on graphical method, and in this lecture, we will solve a linear programming problem by graphical method for no feasible region or no feasible solution. Operations Research Lectures (Full Playlist) 👉    • Operations Research | Computer Optimizatio...