Скачать или смотреть Linear Programming Problems(LPP) | UnBounded Feasible Region - 2 | Class 12 | Rohit Ranjan (IIT KGP)

Linear Programming Problems | Unbounded Feasible Region | No Minimum Value (Common Points) | Class 12 Maths

In this video, we solve a Linear Programming Problem (LPP) where the feasible region is unbounded and common points exist between the objective function and the feasible region, yet the minimum value does not exist.

This example clears a major misconception that having common points guarantees a maximum or minimum value.

📌 Problem discussed in this video:

Minimize
Z = −50x + 20y

Subject to the constraints:
2x − y ≥ −5
3x + y ≥ 3
2x − 3y ≤ 12
x ≥ 0, y ≥ 0

🔹 What you will learn in this video:

Graphing multiple inequalities correctly

Identification of an unbounded feasible region

Understanding common points vs optimal value

Why the objective function keeps decreasing infinitely

Why minimum value does NOT exist even though common points exist

How to justify “no minimum value” in board exams

🔹 Conceptual focus:
✔ Difference between common points and optimal solution
✔ Role of objective function direction
✔ Clear graphical reasoning required in CBSE answers

This video is extremely useful for Class 12 CBSE students and JEE aspirants, especially for mastering exceptional cases in Linear Programming Problems.

📌 This video strengthens conceptual understanding of unbounded regions and non-existence of minima.

linear programming problems, lpp class 12, unbounded feasible region lpp, no minimum value lpp, common points lpp, graphical method lpp, minimize z lpp, lpp special cases, corner point theorem lpp, objective function lpp, constraints in lpp, class 12 maths lpp, linear programming class 12 maths, cbse class 12 mathematics, lpp important questions, unbounded region linear programming, lpp board exam questions, lpp conceptual problems, linear programming graphical method, class 12 maths linear programming