Graphical Method - Part 2

This video lesson is available to enrolled students.

Enroll to watch — Coal India Management Trainee (CS) Recruitment 2026

AI Summary

An AI-generated summary of this video lecture.

This video is a comprehensive lecture on solving Linear Programming Problems (LPP) using the Graphical Method. The instructor begins by introducing the core components of an LPP, including the objective function, decision variables (x, y), and constraints. He then presents a specific problem: maximize z = 6x + y, subject to the constraints 2x + y ≥ 3, y - x ≥ 0, and x, y ≥ 0. The solution process involves graphing these inequalities on a coordinate plane to identify the feasible region, which is the area where all constraints are satisfied. The instructor demonstrates how to find the corner points of this region, such as A(1,1) and B(0,3), and then evaluates the objective function at each point to determine the optimal solution. The video also covers the concept of unbounded solutions, where the feasible region extends infinitely, and infeasible solutions, where no feasible region exists. The lecture concludes with a summary of the different possible outcomes of an LPP: a unique optimal solution, an unbounded solution, or no feasible solution.

Chapters

1. 0:00 – 2:00 00:00-02:00

   The video opens with the instructor standing in front of a whiteboard titled 'Linear Programming Problem'. He introduces the topic and the 'Graphical Method'. He writes the decision variables 'x, y' and explains that the objective function may increase for a maximization problem or decrease for a minimization problem. He also introduces the concept of an 'Unbounded Solution'.

2. 2:00 – 5:00 02:00-05:00

   The instructor writes out a specific Linear Programming Problem: 'Prob: MAX z = 6x + y' subject to the constraints '2x + y ≥ 3', 'y - x ≥ 0', and 'x, y ≥ 0'. He then begins to graph the first constraint, 2x + y ≥ 3, by finding its intercepts. He plots the point (0,3) and (1.5,0) and draws the line 2x + y = 3, indicating the region above the line as the solution for this inequality.

3. 5:00 – 10:00 05:00-10:00

   The instructor continues graphing the constraints. He plots the line y = x (from y - x ≥ 0) and shades the region above it. He then plots the line x = 0 (the y-axis) and y = 0 (the x-axis) to represent the non-negativity constraints. The intersection of all shaded regions forms the feasible region, which is a bounded area. He identifies the corner points of this region, labeling them A(1,1) and B(0,3).

4. 10:00 – 15:00 10:00-15:00

   The instructor evaluates the objective function z = 6x + y at the corner points of the feasible region. At point A(1,1), z = 6(1) + 1 = 7. At point B(0,3), z = 6(0) + 3 = 3. He concludes that the maximum value of z is 7, which occurs at point A(1,1). He then draws a table to summarize the results, showing the extreme points and their corresponding objective function values.

5. 15:00 – 17:27 15:00-17:27

   The instructor discusses the different types of solutions for an LPP. He defines an 'Unbounded Solution' as having an infinite number of solutions, which occurs when the feasible region is not bounded. He then introduces an 'Infeasible Solution', where no feasible region exists because the constraints are contradictory. He provides an example of two constraints, x + y ≤ 1 and -3x + y ≥ 3, which have no common solution, resulting in no feasible solution.

The video provides a clear, step-by-step demonstration of the Graphical Method for solving Linear Programming Problems. It systematically covers the process from formulating the problem with an objective function and constraints, to graphing the feasible region, identifying its corner points, and evaluating the objective function to find the optimal solution. The lecture effectively distinguishes between the three possible outcomes of an LPP: a unique optimal solution (as in the main example), an unbounded solution, and an infeasible solution, providing a comprehensive understanding of the method's application and limitations.