Sensitivity Analysis of a Linear Programming Problem - Part One- Simplex Matrix Math

preview_player
Показать описание
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.

zorosama
Автор

You are the best!!!You've really helped a lot!I look forward for the part 2 :)
Thank you very much!!

dobyxn
Автор

God bless you ma'am you have no idea how important this was for me

umairswati
Автор

The most insightful one, I found on the YouTube!!

samarthzala
Автор

Thank you so much!!!! You helped me pass my final XD

michael-alexandermcpherson
Автор

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

manuelaidos
Автор

excelente video! muy bien explicado. Gracias

eitolo
Автор

:( operational research exam tomorow.. hoped you had them stashed on some website. Thank you in advance

MirceaAgrigoroaie
Автор

I could not understand how you had chosen the basic and non-basic variables :/

cihangiraltugtas
Автор

Is there a part two? Your course is great!

MirceaAgrigoroaie
Автор

ur writing is bad.. can't understand

AJ-kcqp