Although I am trying to get your lectures scarcely at my end, they are my references which enlighten my preperations for my students. I am really proud of being in your circle and have direct link with you. God bless you Sir Ji
Great ...I understand this sum very well... I am persuing MSC.Statistics ..sir ..Not only this all your videos are really very helpful Sir.. It makes me to understand the concepts.... If I am were in the clg where Your working definitely I would became an Statistics professor..But I didn't get that opportunity but still watching these videos makes me soo happy.... Thanks a looooot sir❤️
For Maximization Problem, entering variable, either take the most negative value OR take the most positive value in magnitude (only in those variables whose values zj-cj
@@DrHarishGarg Thank you sir For this problem at 25:59 timestamp can I use the box method to calculate the simplex tableau entities. th-cam.com/video/OIH3eE67fzo/w-d-xo.html/
Sir how to solve this problem. According to your explaination of the simplex method, we need a negative entry in the row (Zj-Cj). But in this problem that row is already positive in the very first step. Then how can we start the procedure. PROBLEM. Minimize 2X1+4X2+X3+X4 S.t. X1 + 3X2 + X4
This kind of problem also discussed in the lecture... Watch fully.... Otherwise you have to first change Minimiize Z to Maximize Z as Max Z = -2x1-4x2-x3-x4 and then solve any problem... It will give you perfect answer through my this lecture.... At the last, whatever you got the answer say 45 then your final Answer is -45. Best wishes...
@@DrHarishGarg Sir thank you for your efficient response. I appreciate your commitment. But, my question is that to start the simplex procedure we need a negative entry in the Zj-Cj row. But here when I convert it into a maximization problem, all entries in the Zj-Cj row becomes positive in the very first step. So how we can find pivot column and key entry then. Thanks
Ok. If this is the case then there are two cases... (1) Your current solution is feasible (Check Sol Xb column in the simplex table, is all entries are >=0) if yes, then first table itself is the optimal one..... (2) If current is NOT Feasible (if atleast one entry in sol column is
@@DrHarishGargSir thank you so much for your time. May u be blessed more. In that problem, all entries in the solution column of the first tableau are >=0. But that's in the very first step so we don't have the minimum value of the function. Hence if I follow your instructions then I may get an optimal solution i.e. entries in the solution column, but I can't get the minimum value of the function. Sorry for the disturbance. And thanks for your co-operation
Although I am trying to get your lectures scarcely at my end, they are my references which enlighten my preperations for my students. I am really proud of being in your circle and have direct link with you. God bless you Sir Ji
Its my pleasure always dear Abdullah
Great ...I understand this sum very well... I am persuing MSC.Statistics ..sir ..Not only this all your videos are really very helpful Sir.. It makes me to understand the concepts.... If I am were in the clg where Your working definitely I would became an Statistics professor..But I didn't get that opportunity but still watching these videos makes me soo happy.... Thanks a looooot sir❤️
your process makes a lot of help in calculations; thank you Sir...
You are most welcome... Keep watching and sharing the video with others too
Thanks Sir
god bless you
world's creator almighty bless you all always and you all remember him always
Sir at 19:00 kaise aapne entry put kri identity bolkrr smjh nhi aaya
Plz reply
Nice explaination sir thanks 🔥
24:42 why the pattern of determinant changes ?
Dear... Short cut tricks is always start from box element when finding the determinant... Also explained the same in the video too... Listen again
Thank you, sir, the explanation really helped me in viva
Sir 10:26 pr most negative value lege for entering variable k liye
For Maximization Problem, entering variable, either take the most negative value OR take the most positive value in magnitude (only in those variables whose values zj-cj
Yes it was confusing coz the variable taken is most negative
Sir what if all the column entries are negative? How will find pivot row then?
If all the columns are negative and Z_j-C_j
@@DrHarishGarg thank you so much sir🙏
for the pivot column do u find the most positive value or the most negative. u said positive but found the most negative
Most negative.
@@DrHarishGarg gr8
Thanks, sir.
My pleasure.
Thank you sir. Please, could you make a video about pattern search optimization method?
Ok... I will make a video and upload it soon...
Meanwhile, keep watching and sharing the videos with your friends too.
Hooke Jeeves Pattern Search Method Uploaded. Watch the video
Link: th-cam.com/video/-rupdjclC0o/w-d-xo.html
How is -5 most positive value in the first table ?
It will be most negative instead of+ve
First I realised that my video is in 2X but 😂, plz explain lil slow, dear sir if possible😊
Sir Inventory theroy kku mcq video upload sir
s3 value -5/2 is wrong it will be 11/2
if we get all negative min ratio then how to find pivot element
Min ratio can never be negative ... In that case, it is unbounded solution.
Correct, how to do it then?
Sir can I take zero in min.ratio? Please sir reply me my exam is tomorrow.
Yes
@@DrHarishGarg Thank you sir love from odisha .....
Sir if we can not form a box in the tableau, then what is the procedure for the shortcut technique?
2nd way is to, use elementary row operations like R2-3R1, R3- (4/3)R1 etc
Also, if you can not form a box in the tableau, then check your calculation, something is wrong
@@DrHarishGarg Thank you sir
For this problem at 25:59 timestamp can I use the box method to calculate the simplex tableau entities.
th-cam.com/video/OIH3eE67fzo/w-d-xo.html/
Yours lectures are very helpful sir 👍👍👍🤲.
Kindly tell me the book name which you prefer for this whole lecture series.
Thanks...keep watching and share with others students too..
Note one particular book... But see description... Book link is given
Sir how to solve this problem. According to your explaination of the simplex method, we need a negative entry in the row (Zj-Cj). But in this problem that row is already positive in the very first step. Then how can we start the procedure.
PROBLEM.
Minimize 2X1+4X2+X3+X4
S.t. X1 + 3X2 + X4
This kind of problem also discussed in the lecture... Watch fully.... Otherwise you have to first change Minimiize Z to Maximize Z as
Max Z = -2x1-4x2-x3-x4
and then solve any problem... It will give you perfect answer through my this lecture....
At the last, whatever you got the answer say 45 then your final Answer is -45.
Best wishes...
@@DrHarishGarg Sir thank you for your efficient response. I appreciate your commitment. But, my question is that to start the simplex procedure we need a negative entry in the Zj-Cj row. But here when I convert it into a maximization problem, all entries in the Zj-Cj row becomes positive in the very first step. So how we can find pivot column and key entry then. Thanks
Ok. If this is the case then there are two cases... (1) Your current solution is feasible (Check Sol Xb column in the simplex table, is all entries are >=0) if yes, then first table itself is the optimal one..... (2) If current is NOT Feasible (if atleast one entry in sol column is
@@DrHarishGargSir thank you so much for your time. May u be blessed more. In that problem, all entries in the solution column of the first tableau are >=0. But that's in the very first step so we don't have the minimum value of the function. Hence if I follow your instructions then I may get an optimal solution i.e. entries in the solution column, but I can't get the minimum value of the function. Sorry for the disturbance. And thanks for your co-operation
Your welcome... You may give complete LPP so that we can also check the solution for you
Thank you professor
हिंदी में समझा दीजिए, sir please