Simplex Method | Maximization

In this video I discussed the Simplex Method for solve the Linear Programming problem with an example problem of Maximize Z = 3x1+2x2
Subject to constraints
2x1+2x2 ≤ 40
x1+x2 ≤ 24
2x1+3x2 ≤ 60
x1, x2 ≥ 0.
This problem is given for III B.Tech I Sem in 2021 by JNTUH.

[@KaashiVishwanath]

Nice explanation sir

[@yahayamusa1830]

good explanation thanks

[@mechanicalaacharya3508]

❤

[@kiswamartin1083]

Explain clear

[@mechanicalaacharya3508]

Thank you very much....

[@MekdesBekele-j6h]

Thank you

[@mechanicalaacharya3508]

Most welcome.... All d best........

[@ramdeenyadav3339]

Sir clear nhi dikh raha hai

[@mechanicalaacharya3508]

I was uploaded the high qualiity version, kindly check your side. Thank you very much for your kind notice...