Solution of LPP using Simplex Method (maximization problem)
Vložit
- čas přidán 20. 02. 2020
- 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.
Only you, else I never understood simplex method, you have saved me
This is the only understandable video about the simplex method. Thank you for your efforts!
Thank you so much sir for this amazing explanation with amazing teaching techniques and method. 😊🙏
Proud of you Keshav sir. You are making an impact
I love this video. Thanks a lot for explaining it so clearly.
the best on web. thank you man God bless you...
thank you sir for such a nice demonstration of the simplex method
Thank you very much. I learned a lot with you.
Best explanation. Thank you very very very much sir. Finally I'm able to understand it. Many many thanks Sir🙏🙏🙏
Thank you for your comment.
Following are my few relevant video, please share with your student friends:
(1) Introduction and Principle of optimality:
czcams.com/video/2VOQkgYpM_A/video.html
(2) Cargo loading problem:
czcams.com/video/C2vYcnOqJUQ/video.html
(3) Employment smoothening problem:
czcams.com/video/y_aHOV_0MfE/video.html
(4) Linear Programing
Problem(LPP): Formulation of
LPP
czcams.com/video/dAhiPu3mY9c/video.html
(5) Linear Programing
Problem(LPP):
Formulation of LPP numerical-2
czcams.com/video/-mjghpHsNxk/video.html
(6) Linear Programing
Problem(LPP): Graphical
Method to Solve LPP
Graphical Method to Solve LPP:
czcams.com/video/vCrtM-Xkd-g/video.html
(7) Linear Programing
Problem(LPP): Graphical
Method to Solve LPP
Graphical Method to Solve LPP:
czcams.com/video/3LVj17utVVI/video.html
(8) Linear Programing
Problem(LPP): Simplex
Method
Simplex method to solve LPP:
czcams.com/video/S1s6sWtoetg/video.html
(9) Linear Programing
Problem(LPP): Simplex
Method
Big M Method to solve LPP,
czcams.com/video/S1a9aJsJX7k/video.html
(10) Linear Programing
Problem(LPP): Simplex
Method
Flowchart of Simplex Algorithm:
czcams.com/video/vlub2Y6zo-o/video.html
(11) Linear Programing
Problem(LPP): Degeneracy
case in LPP:
czcams.com/video/Gzx-Qv16-lE/video.html
@@KeshavJadhav sure Sir, the content is created with lots of effort...
I found the video to be very informative. Thanks! I really do appreciate the efforts.
Very well covered.....thanks 👏
Thanks for the fantastic explanation
thank you so much for the clear explanation
Thank sir to give explation for this method
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
Tnx u so much sir...
Thanks a lot, I really need it! :)
Nicely explained 👍
excellent sir. Very nicely explained
Very well explained
Thanks very much Sir it is delivered in the possible best way. But poor sound is there.
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 :))))
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.
Thanks a lot Sir 😊
How do you come up with the R1= 2× R1 and the other others because there different on all the tables being created
It is as per requirement, basically we have to make zero all other elements in the key column(different than key row)
Best explanation
Thank you Sir.
Thank you very much sir
thank you so much sir🙏
thank you very much.
Thank you sir .
Greatest video ever
Thank u sir...
Very nicely explained. 🙏🙏
Thank you.
Sir I have inventory level problem can you give the answer
So nicely lecture
Thank u sir❤
Excellent video. Great explanation.
Tq sir
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 😭
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.
Si muonge Kizungu bana, shida yenu ni gani?
thank you
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
good !!
THANK'S
Thanks
Very good sir
👍🏻👍🏻
Hello sir...
Last iteration method Cj-zj can be negative? (s1and s2 column)
Yes, it can be negative.
Thank you
@@chithra2364
I would like to share playlist of other relevant videos, if you found useful then please share with your student friends.
czcams.com/play/PLPS67918Zad3H1ftE6DzZ_XHKLp8jAuvy.html
good
If Cj- Zj are equal for x1 and x2 then how to determine key column??
Then that is degeneracy case, please watch below link video to know more about degeneracy case problem:
czcams.com/video/Gzx-Qv16-lE/video.htmlfeature=shared
@@KeshavJadhav thankyou sir
Very nice video
Thank you sir for such wonderful explanation.
I request that you do another one with three constraints
Sir can u send this in pdf format
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
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
@@KeshavJadhav thank you sir
Nice
How do we know that we got the maximum value? Please tell me
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.
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
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
@@KeshavJadhav thank you sir
Sir I have a doubt..does simplex method give different solu
Or is there a single answer for simplex method
@@abhirami_krishna_r2213 , there can be multiple optimum solutions for a particular problem, but we get single optimum solution using simplex method.
NYC lecture
I bet you could have typed "nice" in less clicks than "NYC"
@@AnkitAye haha🤣
Solve as soon as possible sir ..
Which is the decision variable here
Here decision variables are x1 and x2
Why are we using S ?? Why the Cb is zero taken ?? I don't understand this can u plzz tell me
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)
I have not understand in the way we solve table 2 especially when getting R2
In table 2, I have simply performed
R2= R2/2.
@@KeshavJadhav but in other questions I tried to solve and use the same procedure but I failed
@@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.
Representing Swahili Nation Universty🇹🇿🇹🇿🇹🇿
Why is cj - zj , +ve , when 0-7 is -7 ???
🤔🤔🤔
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.
@@KeshavJadhav Oh ohkay , I get it ...Thank you sir
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)
R2/2 ????
Second row divided by 2
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
why on the objective fun. slack value is zero
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, ......)
no chutney?
It's up to you, depends on way to looking at things.
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.
cbom.atozmath.com/CBOM/Simplex.aspx?q=sm&q1=2%602%60MAX%60Z%60x1%2cx2%2cx3%6030%2c20%603%2c1%3b1%2c1%60%3c%3d%2c%3c%3d%601500%2c3000%60%60D%60false%60true%60false%60true%60false%60false%60true%601&dp=4&do=1#PrevPart
@@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 ....
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
class is lagging in between
Best explanation
Thank you sir
Tq sir