Simplex Method | Maximization
Вставка
- Опубліковано 30 вер 2024
- 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.
Explain clear
Thank you very much....
Nice explanation sir
good explanation thanks
❤
Thank you
Most welcome....
All d best........
Sir clear nhi dikh raha hai
I was uploaded the high qualiity version, kindly check your side.
Thank you very much for your kind notice...