How to Solve a Linear Programming Problem Using the Big M Method

preview_player
Показать описание
In this lesson we learn how to solve a linear programming problem using the big M method. Change the setting of your youTube to HD for the best quality.
Рекомендации по теме
Комментарии
Автор

Definitely the best tutorial in between those bunch of big m videos. Thank you so much.

Jedilance
Автор

Fantastic tutorial!Thank you very much for your videos!I will hopefully pass my final exams thanks to you!

mariamilingou
Автор

this will definately help me to clear my you ma'm

pradeepgaur
Автор

Thanks Great
Best In Youtube For BIG M method :)

ashiqahamed
Автор

I'm used to reading cursive, so i find your handwriting legible. But I think it may indeed help others who aren't accustomed to cursive if you were to write in capitals. Nice handwriting though.
Great videos too, it was a clear explanation

perkelele
Автор

Very good job! Best tutorial of big M on youtube

herryfrd
Автор

Thanks for the wonderful tutorials. Best ones I've used to learn.

emptyclud
Автор

Brilliant, Thank you very much Shokoufeh :)

nerdumdigitalis
Автор

i have my Operation Research exam in next 2 hrs and here I am watching this video

shauryamalik
Автор

Thanks professor, please upload some videos about sensitivity and shadow price,
kheylii khub boodm mamnun, goftam farsi am tashakor karde basham ;)

poorianorouzi
Автор

you are really good, thank you professor

cansengul
Автор

thank you ma'am, you are awesome.

luckymact
Автор

Mirzaei, this session was good and very useful. Did you posted any video relating Gomory's Cutting plane method and Branch & Bound method problems. Kindly give the link. Thanks

sankarkumar
Автор

You helped a lot but I didn't understand how and why you switched from s2 to e4

MerveNoyan
Автор

Thank you for the videos, they are great. I have two questions :
Do we always add -M ? or we add -M for maximization problem and M for minimization problem ?
Same question for the artificial variable (a) ?

waraymohamedamine
Автор

Thank you professor but i have one question. What we supposed to do when there is more than one > or = sign ? 

harun
Автор

So if I get it right..if the initial problem was a minimization problem then we would have to add e's to the <= conditions and subtract a's and then to the initial equation we first add +Ma and after it all we would have Z-3x1-4x2-Ma=0 ?

mariamilingou
Автор

What if all z row elements are positive but you still have M at the final value of z??

LuKaSoo
Автор

so if the artificial variable (either a4 or 4e) are another number other than 0, does that mean that there is no optimal solution, because there is no feasible region?

camilot
Автор

Hey Prof
So do we use artificial variables in Simplex too in case we have a perfect equality constraint?

loganism
join shbcf.ru