Hindi : Theorem 1 - Let R be the feasible region.... Linear Programming - Ch 12 - CBSE 12th Math

preview_player
Показать описание
In this video we will proof the theorem 1 - "Let R be the feasible region (convex polygon) for a linear programming problem and let Z = ax + by be the objective function. When Z has an optimal value (maximum or minimum), where the variables x and y are subject to constraints described by linear inequalities, this optimal value must occur at a corner point* (vertex) of the feasible region."

Don't forget to subscribe our Youtube channel to receive fresh learning lessons every day.

On Facebook :

Watch more videos on :
Рекомендации по теме
Комментарии
Автор

THIS VEDIO DOES NOT CONTAIN ANY PROOF OF THIS THEOREM....

ultralegends