10 years too late, but for those watching and still confused on the beginning part with 's_2' being replaced with 'x_3', I'm almost 100% sure it was because at the start of the Simplex Method, the pivot number that was selected was in column x_3 and row s_2. And you just switch the row variable with the column variable at that given intersection (where your pivot number is). PatrickJMT shows it at 1:53.
Thank you very much, finally a clear and simple explanation to these problems, this is so incredibly tedious, I wanna cry and I need to sleep after 4 of these because of the amount of concentration that it takes to do this, but you made it a good bit easier.
I"m trying to use simplex to solve a min problem and after just one pivot step I had no negatives on the bottom. Does that mean I don't have to do it three times like you did?
Hi, thnx for your simplex method video post. You did the maximization simplex method. please can you do minimization simplex method? Also can you do dual method?
Could you please add link to play list or to the first part, it's not that i'm lazy but clicking through all parts does not help because youtube never suggests the first video.
In the processes you replace (s2 with x3) and ( s1 with x2 ) I understand that but I still cannot get why in the last part you replace (x2 with x1) ? is there any rule for this ?. Thank you
Patrick I'd like to know how to identify an uunbounded, infeasible, multipl solution and unique solutions please help I'm writing and I read it over and over and still don't understand
for this sht it doesnt work: (if a number after "x", it is a smaller one - its a count num)) p=2*x1+x2+2*x3+x4+3*x5 ---> max x1+3*x3+4*x4+3*x5 equall or less then 6 (here is no x2) 4*x1+2*x2+x3+x4+2*x5 equall or less then7 x1...x6 >= 0. (it looks almost the same. I dont know why it doesnt work. Spent several hours to find a mistake. There is no. "P" at the end will get more and more minuses).
sir i am a bit confused. because in minimization you transposed raws become column but in this example you did not. does that matters? is it that when you maximize you don't transpose and only when you minimize ?
10 years too late, but for those watching and still confused on the beginning part with 's_2' being replaced with 'x_3', I'm almost 100% sure it was because at the start of the Simplex Method, the pivot number that was selected was in column x_3 and row s_2. And you just switch the row variable with the column variable at that given intersection (where your pivot number is). PatrickJMT shows it at 1:53.
Helping people to pass their exams as always. Thanks Patrick!
I was struggling with simplex for so long - saw your videos and just understood it so quickly! Brilliant stuff. THANK you!
@Lotrioni hope it turned out well for you :)
youve just saved me of at least 2 hours note reading!
Thank you very much, finally a clear and simple explanation to these problems, this is so incredibly tedious, I wanna cry and I need to sleep after 4 of these because of the amount of concentration that it takes to do this, but you made it a good bit easier.
my exam is in 30 mins, wish me luck and thanx patric owe most of it to u
how was it
I can’t even remember any of this!
How can you reply a 10 year old comment 😅
Thank you very much for breaking this method down. It helps me tons.
@dmokhtar u r very welcome!
missed the period and I came here... thanks
did not understand, why you replaced (s1 with x2) and (s2 with x3)
5 years too late but oh well - it's because of x2/x3 being the pivot collumn. It's a rule, basically.
@@sixtynine226 thanks for commenting, even if it's late! that cleared it up for me!
I need help asap to turn an assignment similar to this..... can you help me?
Got it thanks, I got a bachelor's and a master's in this duration, thanks all of you :)
@@karthikunnikrishnan9608 good for you man, let us suffer with this for now.
Really good teaching
thanks alot for giving the general understanding on simplex
I"m trying to use simplex to solve a min problem and after just one pivot step I had no negatives on the bottom. Does that mean I don't have to do it three times like you did?
@nuktu It looks like i'm late but i think it's because it's the column that the row operators were used on. that's why they switched.
Thanks, you are great teacher !
@nuktu I think that's because the pivot is the intersection of s2 row and x3 column
keep the great content comming.
why does s2 turn into x3
Could you also explain how you decide which row operator you use?
you are a hero
Thank you, Patrik !
Your are doing a great job .thank you so much
Great video. Thanks but can you do a minimization prob also. Please. I have an exam day after tmo.
thank you patrick !!
Hi,
thnx for your simplex method video post.
You did the maximization simplex method. please can you do minimization simplex method? Also can you do dual method?
Could you please add link to play list or to the first part, it's not that i'm lazy but clicking through all parts does not help because youtube never suggests the first video.
This is just Gauss-Jordan elimination with a new rule added for choosing pivots. (Lots of unnecessary scaling going on here though.)
at 6:00 when you're writing out Row 2, shouldn't you have written 1400 rather then 350?
at 7:48 a little mistake is made, -1/4 * -1/4 = -1/2
just a comment to improve this great video.
Thx a lot for making this look easier!!
That's what it is
can you please explain the term canonical form. thank you
In the processes you replace (s2 with x3) and ( s1 with x2 ) I understand that but I still cannot get why in the last part you replace (x2 with x1) ? is there any rule for this ?. Thank you
can we replace (x3 with x1) ?. Thank you very much
exam in forty minutes, thanks!
Thanx! This helps)
Patrick I'd like to know how to identify an uunbounded, infeasible, multipl solution and unique solutions please help I'm writing and I read it over and over and still don't understand
when we have two equal negative numbers in the base, how we chose?
any one them would do the job ...try it out .
Why did you replace x2 by x1???
+Leanne Caryl Publico That is the rule. After identifying the pivot element and making it as 1. We make it's ROW = Column and never vice versa.
+Ahmad Shumayal yup! figured it out already, thank you
how would be the case if we have more slack variables for example until s3, when we do the row operations (gaussian) we exchange the variables too ?
saved my day bro
Thank you
awesome...thank you very much...
excellent!! thanks!
for this sht it doesnt work:
(if a number after "x", it is a smaller one - its a count num))
p=2*x1+x2+2*x3+x4+3*x5 ---> max
x1+3*x3+4*x4+3*x5 equall or less then 6 (here is no x2)
4*x1+2*x2+x3+x4+2*x5 equall or less then7
x1...x6 >= 0.
(it looks almost the same. I dont know why it doesnt work. Spent several hours to find a mistake. There is no.
"P" at the end will get more and more minuses).
A mistake on 3R1+R3---R3 should have been 13/2 not 7/2
its not a mistake i will show you :
(-1/2)*3+5=(-3/2)+(10/2)=7/2
I thought maximization should have no positive numbers left? I'm so confused????
Lefties FTW! thanks so much for this
Thanks sir
A little mistake it's supposed to be 1/2 not -1/2
thanxs.... it is really useful
It's -1/4 + -1/4, so the result is -1/2.
i just wonder that this video is 9yrs ago😰😰😰... what i was doing ... ??
thanks that is useful (Y)
why couldn't you use decimal numbers make it so much easier to
understand
Shoaib Abbas Fractions are a lot easier to work with when you're facing a problem like this
@bebo900033 a nice feeling : )
sir i am a bit confused. because in minimization you transposed raws become column but in this example you did not. does that matters? is it that when you maximize you don't transpose and only when you minimize ?
This is all so tedius
why are you watching it then???
@@hadenhenha to learn
☯🙏
+1