Example with graphical method

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 lecture on solving a Linear Programming Problem (LPP) using the Graphical Method. The instructor begins by writing the problem's objective function, Max Z = x + y, and its constraints: x + y ≤ 1, -3x + y ≥ 3, and x, y ≥ 0. He then proceeds to graph these inequalities on a Cartesian coordinate system. The first constraint, x + y = 1, is plotted as a line with intercepts at (1,0) and (0,1), and the feasible region is shaded below it. The second constraint, -3x + y = 3, is plotted with intercepts at (0,3) and (-1,0), and the feasible region is shaded above it. The instructor identifies the intersection point of the two lines, labeled as point B, and determines that the feasible region is the area bounded by the lines and the axes. He concludes that the optimal solution occurs at a corner point of this feasible region, which is the intersection of the two constraint lines.

Chapters

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

   The video opens with a whiteboard titled 'Graphical Method Linear Programming Problem'. The instructor writes the problem's objective function, Max Z = x + y, and the constraints: x + y ≤ 1, -3x + y ≥ 3, and x, y ≥ 0. He begins to draw the coordinate axes, labeling the x and y axes. He then plots the first constraint, x + y = 1, by finding its intercepts at (1,0) and (0,1) and drawing a line through them. He explains that the feasible region for this inequality is below the line, which he shades. He then moves to the second constraint, -3x + y = 3, and finds its intercepts at (0,3) and (-1,0). He draws this line on the graph, noting that the feasible region is above this line.

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

   The instructor continues to work on the graph, shading the feasible region for the second constraint, -3x + y ≥ 3, which is above the line. He then identifies the intersection point of the two lines, which he labels as point B. He explains that the feasible region is the area that satisfies all constraints simultaneously, which is the region bounded by the two lines and the axes. He points to the corner points of the feasible region, including the origin (0,0), the point (1,0), and the intersection point B. He notes that the optimal solution for a maximization problem will occur at one of these corner points. He then begins to analyze the feasible region, which is a polygon bounded by the lines and the axes.

3. 5:00 – 6:14 05:00-06:14

   The instructor completes the graph by shading the final feasible region, which is the area that satisfies all constraints. He points to the corner points of the feasible region, including the origin (0,0), the point (1,0), and the intersection point B. He explains that the optimal solution for the maximization problem will occur at one of these corner points. He then identifies the intersection point B as the point where the two constraint lines meet, and he notes that this is the only point that satisfies both constraints simultaneously. He concludes that the optimal solution is at point B, which is the intersection of the two lines.

The video provides a step-by-step demonstration of the graphical method for solving a linear programming problem. It begins by clearly stating the objective function and constraints. The core of the lesson involves translating these algebraic constraints into a visual representation on a coordinate plane. The instructor methodically plots each constraint line, determines the correct side of the line for the feasible region, and then identifies the intersection of these regions. The final step is to recognize that the optimal solution for a maximization problem lies at a corner point of the feasible region, which in this case is the intersection of the two constraint lines. The video effectively uses the whiteboard to illustrate the entire process, from problem formulation to graphical solution.