In this video detail explanation is given for each steps of simplex method to solve maximization type LPP. Also comparison of graphical method and simplex method is given in this video by Keshav Jadhav.
Пікірлер: 115
@herodmoonga479918 күн бұрын
Only you, else I never understood simplex method, you have saved me
@eren_1oglu7 ай бұрын
This is the only understandable video about the simplex method. Thank you for your efforts!
@smileumeshful2 жыл бұрын
Proud of you Keshav sir. You are making an impact
@poojamishra77183 жыл бұрын
Thank you so much sir for this amazing explanation with amazing teaching techniques and method. 😊🙏
@nargesmashhadinejad13622 жыл бұрын
I love this video. Thanks a lot for explaining it so clearly.
@betweener23133 жыл бұрын
the best on web. thank you man God bless you...
@sajadmir94922 жыл бұрын
thank you sir for such a nice demonstration of the simplex method
@injeolmi62 жыл бұрын
Thank you very much. I learned a lot with you.
@arnavanuj3 жыл бұрын
Best explanation. Thank you very very very much sir. Finally I'm able to understand it. Many many thanks Sir🙏🙏🙏
@KeshavJadhav3 жыл бұрын
Thank you for your comment. Following are my few relevant video, please share with your student friends: (1) Introduction and Principle of optimality: kzbin.info/www/bejne/aIeygp6djtWAlaM (2) Cargo loading problem: kzbin.info/www/bejne/eWPZipakhNZ9i7M (3) Employment smoothening problem: kzbin.info/www/bejne/r5DEeYKMlJWAnKc (4) Linear Programing Problem(LPP): Formulation of LPP kzbin.info/www/bejne/mnLLmoOraNKMb8U (5) Linear Programing Problem(LPP): Formulation of LPP numerical-2 kzbin.info/www/bejne/Y57NmJumfdiBrs0 (6) Linear Programing Problem(LPP): Graphical Method to Solve LPP Graphical Method to Solve LPP: kzbin.info/www/bejne/rHTVpYBjjdCXY8k (7) Linear Programing Problem(LPP): Graphical Method to Solve LPP Graphical Method to Solve LPP: kzbin.info/www/bejne/aX25m2RtqtmJjKs (8) Linear Programing Problem(LPP): Simplex Method Simplex method to solve LPP: kzbin.info/www/bejne/iWLWZ6aNqdSYqsk (9) Linear Programing Problem(LPP): Simplex Method Big M Method to solve LPP, kzbin.info/www/bejne/iWLEapSAqK-Lbc0 (10) Linear Programing Problem(LPP): Simplex Method Flowchart of Simplex Algorithm: kzbin.info/www/bejne/rJ3Yk2WPa9-iY9E (11) Linear Programing Problem(LPP): Degeneracy case in LPP: kzbin.info/www/bejne/favbXoSsZptgoqc
@arnavanuj3 жыл бұрын
@@KeshavJadhav sure Sir, the content is created with lots of effort...
@syedshadab31782 жыл бұрын
I found the video to be very informative. Thanks! I really do appreciate the efforts.
@gauravranjan57472 жыл бұрын
Very well covered.....thanks 👏
@badmusidowu3793 жыл бұрын
Thanks for the fantastic explanation
@nishasworld90423 жыл бұрын
Thank sir to give explation for this method
@Maki-mh2oz2 жыл бұрын
thank you so much for the clear explanation
@komalpreetkaur50552 жыл бұрын
Best explanation
@AnilKumar-xh7vl3 жыл бұрын
sir you are really super sir. due to the pandamic situations of covid we are not able to understand the online classes, but you really explained a lot sir.. thank u sooooooo much sir
@simanchalapanda87352 жыл бұрын
Tnx u so much sir...
@chinesecultureinessence15346 ай бұрын
Thanks a lot, I really need it! :)
@MrMillionmekonnen13 жыл бұрын
Thanks very much Sir it is delivered in the possible best way. But poor sound is there.
@lakaderohidas18292 жыл бұрын
So nicely lecture
@mithusblog67872 жыл бұрын
Nicely explained 👍
@hamshihamsu54612 жыл бұрын
Thank you very much sir
@AnjaliSingh-kv3vl3 жыл бұрын
Very well explained
@JVARSHINI-vx8ww3 жыл бұрын
Thanks a lot Sir 😊
@pallavimahadik65333 жыл бұрын
excellent sir. Very nicely explained
@bagurusubscribemadu46733 жыл бұрын
Thank you Sir.
@shristysaumya20473 жыл бұрын
Thank you sir .
@user-xw2pt4le3b2 жыл бұрын
thank you very much.
@snillochemingson28303 жыл бұрын
Greatest video ever
@suchetahegde27093 жыл бұрын
Very nicely explained. 🙏🙏
@KeshavJadhav3 жыл бұрын
Thank you.
@rishantsrivastava78923 жыл бұрын
Thank u sir...
@gaikoahgatwech1866 ай бұрын
thank you so much sir🙏
@Dhanadi20017 ай бұрын
Thank u sir❤
@meganjones85113 жыл бұрын
when creating the new row 2 in the final tableau, instead of your formula R2=R2-0.5xR1, i multiplied the old row 2 by 2 and then minused the new row 1. (meaning my values were all double yours). I have not got the same final results and it indicates that s1 variable is still profitable (which is obviously isn't). Is there therefore a correct and incorrect way to formulate new rows? Plzzz help as exam is next week :))))
@KeshavJadhav3 жыл бұрын
Dear Megan Jones, Basically we need to write operation to convert other elements in key column onto zero (0.5 in R2). So, correct operation can be R2=R2-0.5R1. In your operation our basic objective behind writing operation is not fulfilled.
@pbotharaj Жыл бұрын
Excellent video. Great explanation.
@norvyannebernal232 жыл бұрын
Hi, I just want to ask, what if the S1 has the lowest value, thus, it is the outgoing variable that is replaced by variable x as the incoming variable, how is that? The next table would be change? Since S1 has the lowest value? Or we stick to the step where in S2 is the outgoing variable that will replaced by variable x as the incoming variable? I hope you answer me, I badly needed to know, you're the only one explanation I've Understood easily 😭
@KeshavJadhav2 жыл бұрын
To decide outgoing variable, we need to calculate ratio column= b/key column. I am sure if you once again watch this video till end, then you will clearly understand the steps.
@vivekkumar-py6kp7 ай бұрын
Thanks
@MinewerHussen-nx1hx8 ай бұрын
THANK'S
@kalabamulenga32263 жыл бұрын
How do you come up with the R1= 2× R1 and the other others because there different on all the tables being created
@KeshavJadhav3 жыл бұрын
It is as per requirement, basically we have to make zero all other elements in the key column(different than key row)
@ashwiniawale62253 жыл бұрын
👍🏻👍🏻
@pavanidontoju21213 жыл бұрын
Tq sir
@halikarclassesdegloor2659 Жыл бұрын
Very good sir
@chemedajoresa706010 ай бұрын
thank you
@somsekhararaofacultymechan58063 жыл бұрын
good
@MurtiiBoneyaDanbala Жыл бұрын
good !!
@teshalearega Жыл бұрын
5. A merchant plans to sell two types of personal computers - a desktop model and a portable model that will cost Birr 25000 and Birr 40000 respectively. He estimates that the total monthly demand of computers will not exceed 250 units. Determine the number of units of each type of computers which the merchant should stock to get maximum profit if he does not want to invest more than Birr 70 lakhs and if his profit on the desktop model is Birr 4500 and on portable model is Birr 5000. (Find optimal Solution by simplex Model)
@sindhujashukla86903 жыл бұрын
Very nice video
@symoh013 жыл бұрын
Thank you sir for such wonderful explanation. I request that you do another one with three constraints
@abdijeylan8290 Жыл бұрын
Nice
@govardhansonu374910 ай бұрын
Can you do simplex maximization problem while 3 constraints are there. Like s1 , s2 and S3 . To find. And I am unable to understand in iteration 2 while doing what we should take r1 r2 and r3 formulas in iteration 2. In iteration 2. So plzz make one video of simplex maximization problem in s1 S2 and S3 and finding solution of r1 r2 and r3 formulas for 3 constraints
@Brigadier8192 жыл бұрын
Representing Swahili Nation Universty🇹🇿🇹🇿🇹🇿
@malshi78203 жыл бұрын
Sir I have inventory level problem can you give the answer
@ankithagoud97493 жыл бұрын
NYC lecture
@AnkitAye3 жыл бұрын
I bet you could have typed "nice" in less clicks than "NYC"
@ankithagoud97493 жыл бұрын
@@AnkitAye haha🤣
@teenskeey21572 жыл бұрын
Si muonge Kizungu bana, shida yenu ni gani?
@utkarshupadhyay4847 Жыл бұрын
Solve as soon as possible sir ..
@shivaakuei32477 ай бұрын
Solve the following Linear Programming problem using the Dual Simplex methods. Max XO = 4x1+x2 S.t 3x1+ x2=3 4x1+3x2 ≥6 x1+2x2 ≤3
@khushieverma9 ай бұрын
If Cj- Zj are equal for x1 and x2 then how to determine key column??
@KeshavJadhav9 ай бұрын
Then that is degeneracy case, please watch below link video to know more about degeneracy case problem: kzbin.info/www/bejne/favbXoSsZptgoqcfeature=shared
@khushieverma9 ай бұрын
@@KeshavJadhav thankyou sir
@chithra2364 Жыл бұрын
Hello sir... Last iteration method Cj-zj can be negative? (s1and s2 column)
@KeshavJadhav Жыл бұрын
Yes, it can be negative.
@chithra2364 Жыл бұрын
Thank you
@KeshavJadhav Жыл бұрын
@@chithra2364 I would like to share playlist of other relevant videos, if you found useful then please share with your student friends. kzbin.info/aero/PLPS67918Zad3H1ftE6DzZ_XHKLp8jAuvy
@abhirami_krishna_r22133 жыл бұрын
Sir I have a doubt..does simplex method give different solu
@abhirami_krishna_r22133 жыл бұрын
Or is there a single answer for simplex method
@KeshavJadhav3 жыл бұрын
@@abhirami_krishna_r2213 , there can be multiple optimum solutions for a particular problem, but we get single optimum solution using simplex method.
@AC-os6er2 жыл бұрын
Hi, isn’t the formula zj-Cj cuz that’s how it’s given in my book? And I wanted some videos which has Zj - Cj and not Cj - Zj
@KeshavJadhav2 жыл бұрын
Both way are right. I have used Cj-Zj. If we use Zj-Cj then key column selection rule will be opposite of (Cj-Zj). I hope it is clear to you
@AC-os6er2 жыл бұрын
@@KeshavJadhav thank you sir
@techmaestro29322 жыл бұрын
Good explanation sir but i have a doubt my college professor and also in my book operation is Zj--_Cj but you perform Cj-- Zj please sir explain which is right
@KeshavJadhav2 жыл бұрын
I have used Cj-Zj. If we use Zj-Cj then key column selection rule will be opposite of (Cj-Zj). I hope it is clear to you
@techmaestro29322 жыл бұрын
@@KeshavJadhav thank you sir
@tejaswinikhandekar4412 жыл бұрын
Which is the decision variable here
@KeshavJadhav2 жыл бұрын
Here decision variables are x1 and x2
@farhafatima82192 жыл бұрын
Why are we using S ?? Why the Cb is zero taken ?? I don't understand this can u plzz tell me
@KeshavJadhav2 жыл бұрын
S is used to convert given equation into standard form(watch at 2:15min). Cb is value of coefficient of current basic variable (watch at 5:45min)
@fasikamillion5519 Жыл бұрын
How do we know that we got the maximum value? Please tell me
@KeshavJadhav Жыл бұрын
You can check valve of objective function (z) at all other feasible points, it will be less than value which is optimum . If watch last part of this video (graphical method) then you will get clear idea.
@swetanandi49643 жыл бұрын
Why is cj - zj , +ve , when 0-7 is -7 ??? 🤔🤔🤔
@KeshavJadhav3 жыл бұрын
It is Cj-Zj = 7-0 = 7 (+ve). You might be confused because in some book instead of Cj-Zj, they have taken Zj-Cj.
@swetanandi49643 жыл бұрын
@@KeshavJadhav Oh ohkay , I get it ...Thank you sir
@gladsanga19002 жыл бұрын
I have not understand in the way we solve table 2 especially when getting R2
@KeshavJadhav2 жыл бұрын
In table 2, I have simply performed R2= R2/2.
@gladsanga19002 жыл бұрын
@@KeshavJadhav but in other questions I tried to solve and use the same procedure but I failed
@KeshavJadhav2 жыл бұрын
@@gladsanga1900 basically you need to convert key elements into "1". R2=R2/2 may not be applicable for other questions. Please watch video again. I am sure you will be able to understand concept.
@sonidarshil49083 жыл бұрын
R2/2 ????
@KeshavJadhav3 жыл бұрын
Second row divided by 2
@utkarshupadhyay4847 Жыл бұрын
Maximize Z = 30x + 20y Subject to the constraints, 3x + y ≤ 1500 1x + y ≤ 3000 x , y ≥ 0 Solve LPP BY SIMPLEX METHOD. Please solve as soon as possible sir .. and send me.
@@KeshavJadhav sir I have one problem based on two phase method and it is also based on some simplex cases :- Find the maximum value of Z = 107X1 + X2 + 2X3 S.t . 14x1 + x2 - 6x3 + 3x4 =7 16x1 + x2 - 6x3 ≤ 5 3x1 - x2 - x3 ≤ 0 x1 , x2 , x3 , x4 ≥ 0 Solve sir please .... as soon as possible ....
@esubalewbacha2616 Жыл бұрын
why on the objective fun. slack value is zero
@KeshavJadhav Жыл бұрын
In objective function, coefficient of slack variable is zero. Because objective of given problem do not include any other parameters than x1, x2, ...... We have to optimise only given parameters (x1, x2, ......)
@notdaksh7017 Жыл бұрын
no chutney?
@KeshavJadhav Жыл бұрын
It's up to you, depends on way to looking at things.
@alaraerk8304 Жыл бұрын
you need to multiply z by -1 first. max lop is being converted to min firt to obtain its standart form-si your solution is not right