In some cases one of the constraints does not contain X2, lets say they are, x1+2x2-x3 and the second one x1-4x3 so the coefficient of x2 on the second row is 0. and when im trying to find the pivot after identifying to pivot column, I can not because it happens to be INTEGER/0... what should i do after this.
Thanks for making this video, it’s the only way I found to maximize three variable. Thats cool
Fantastic professor ...just amazing tricks to figured out the variables.
Thank you prof, and have you done anywhere Real analysis or Abstract Algebra?. I am a fan of your channel.
In some cases one of the constraints does not contain X2, lets say they are, x1+2x2-x3 and the second one x1-4x3 so the coefficient of x2 on the second row is 0. and when im trying to find the pivot after identifying to pivot column, I can not because it happens to be INTEGER/0... what should i do after this.
I have the exact same problem.
Perfect! thanks a million! best tutorial!
maximize z =5x1 + 4x2 + 0s1 + 0s2 + 0s3 + 0s4
subject to 6x1 + 4x2 + s1 = 24
x1 + 2x2 + s2 = 6
−x1 + x2 + s3 = 1
x2 + s4 = 2
and x1, x2, s1
, s2
, s3
, s4 ≥
0
Why X =0 ?
Its an algorithm so only the results that have 1 in the rows are declared as valid points for maximizing the inequality.
Thầy dạy hay quá
you save me my friend, thanks