Corner point method [Hinglish] | Linear programming | Grade 12 | Math | Khan Academy

From the creator

This video explains the Corner Point Method, a fundamental technique for solving Linear Programming Problems. We'll discuss the key theorem stating that the optimal solution (maximum or minimum) must occur at one of the corner points of the feasible region. We'll demonstrate the step-by-step process: find the coordinates of all corner points, substitute these points into the objective function, and compare the results to find the best possible outcome. Courses on Khan Academy are always 100% free. Start practicing—and saving your progress—now! (https://www.khanacademy.org/math/ncert-class-12/x7ce8ca9c5869750b:linear-programming-ncert-new/x7ce8ca9c5869750b:linear-prgramming-problems-and-its-mathematical-formulation/e/graphically-check-solutions-to-inequalities) Timestamps: 00:00 Introduction to the Corner Point Method 00:45 The core theorem: Why the optimal solution lies at a corner point 02:10 Step 1 & 2: Finding the coordinates of all corner points of the feasible region 03:00 Step 3: Evaluating the objective function (Z) at each corner point 04:10 Step 4: Identifying the optimal solution (maximum or minimum value) Khan Academy India is a nonprofit organization with the mission of providing a free, world-class education for anyone, anywhere. We have videos and exercises that have been translated into multiple Indian languages, and 15 million people around the globe learn on Khan Academy every month. Support Us: https://india.khanacademy.org/donate Created by Ashish Gupta

Published 2025-06-05 · Watch on YouTube ↗
Availability and playback restrictions are controlled by the original channel.