Sensitivity Analysis of a Linear Programming Problem - Part One- Simplex Matrix Math
HTML-код
- Опубликовано: 13 сен 2024
- In this lesson, we learn how to regenerate the final (optimal) Simplex table given the optimal set of basic decision variables and the initial Linear Programming problem.
You are excellent. I was worrying about my exam tomorrow as I don't know this concept and you saved my day.
You are the best!!!You've really helped a lot!I look forward for the part 2 :)
Thank you very much!!
The most insightful one, I found on the RUclips!!
God bless you ma'am you have no idea how important this was for me
Thank you so much!!!! You helped me pass my final exam!!!!!!! XD
excelente video! muy bien explicado. Gracias
:( operational research exam tomorow.. hoped you had them stashed on some website. Thank you in advance
this is the way i learned well i can copy the "end" matrix to a paper and use on exam but the problem here is to understand how to use the last matrix to solve the linear programming problem :P
Thank you for clear explanation😊
very good explanation!
Is there a part two? Your course is great!
yes, please check my channel for more videos.
Thankyou, you are amazing
C'est parfait!
I'm so grateful for this video
I could not understand how you had chosen the basic and non-basic variables :/
+Cihangir Altuğ Taş Basic variables are given in the problem statement. whatever is not basic will be non-basic.
Thanks a lot :)
what if the basic/non-basic is not given? how to know it in the first operation? thanks before ☺
if you don't know the basic or non-basic variables in the optimal solution, you cannot conduct sensitivity analysis.
I love you
ur writing is bad.. can't understand