No video

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

  Рет қаралды 116,086

Shokoufeh Mirzaei

Shokoufeh Mirzaei

10 жыл бұрын

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.

Пікірлер: 61
@Jedilance8
@Jedilance8 9 жыл бұрын
Definitely the best tutorial in between those bunch of big m videos. Thank you so much.
@mariamilingou8217
@mariamilingou8217 8 жыл бұрын
Fantastic tutorial!Thank you very much for your videos!I will hopefully pass my final exams thanks to you!
@ashiqahamed9775
@ashiqahamed9775 10 жыл бұрын
Thanks Great Teaching...................... Best In KZfaq For BIG M method :)
@pradeepgaur5362
@pradeepgaur5362 9 жыл бұрын
this will definately help me to clear my CT......thank you ma'm
@shauryamalik3455
@shauryamalik3455 7 жыл бұрын
i have my Operation Research exam in next 2 hrs and here I am watching this video
@perkelele
@perkelele 9 жыл бұрын
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
@emptycl0ud9
@emptycl0ud9 8 жыл бұрын
Thanks for the wonderful tutorials. Best ones I've used to learn.
@herryfrd2740
@herryfrd2740 9 жыл бұрын
Very good job! Best tutorial of big M on youtube
@nerdumdigitalis
@nerdumdigitalis 10 жыл бұрын
Brilliant, Thank you very much Shokoufeh :)
@MuhammadSalman-om4rn
@MuhammadSalman-om4rn 9 жыл бұрын
Very helpful, thanks!
@khaledgh2464
@khaledgh2464 8 жыл бұрын
thank you so much you did great job
@lillianreyes5465
@lillianreyes5465 9 жыл бұрын
Great Video!
@cansengul5915
@cansengul5915 7 жыл бұрын
you are really good, thank you professor
@aysanrafiei5791
@aysanrafiei5791 9 жыл бұрын
hello it was a great video thanks
@srikar720
@srikar720 9 жыл бұрын
excellent professor
@tejasvi0claw
@tejasvi0claw 7 жыл бұрын
Thank you SO much! This was perfect.
@harun5407
@harun5407 9 жыл бұрын
Thank you professor but i have one question. What we supposed to do when there is more than one > or = sign ?
@sxmirzaei
@sxmirzaei 9 жыл бұрын
let's say you have 2 constraints with = and >= signs. Then, you have Max z=3x1+4x2 x1+x2=3 --> x1+x2+a1=3 x1+2x2+3x3>=1 --->x1+2x2+3x3-e2+a2=1 Note that for constraints with "=" sign we don't add any excess variable (e.g. the first constraint in the above example). You need to add both a1 and a2 with big M to the objective function. for example, in this case you have max z=3x1+4x2 ---> z=3x1+4x2-Ma1-Ma2
@harun5407
@harun5407 9 жыл бұрын
Shokoufeh Mirzaei Thank you very much..
@99pedropotter
@99pedropotter 9 жыл бұрын
thank you very much
@waraymohamedamine696
@waraymohamedamine696 7 жыл бұрын
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) ?
@sxmirzaei
@sxmirzaei 7 жыл бұрын
we add -M for a Max and +M for a Min problem. Also, for constraints with >= signs we always add +a regardless of the objective function direction (max or min).
@LuKaS2oo9
@LuKaS2oo9 7 жыл бұрын
What if all z row elements are positive but you still have M at the final value of z??
@sxmirzaei
@sxmirzaei 7 жыл бұрын
if there is M in the final value of Z, it means at least one of the artificial variables is still positive (basic). If you are in the optimal table, this is a sign that shows the problem does not have a feasible solution.
@luckymact1085
@luckymact1085 8 жыл бұрын
thank you ma'am, you are awesome.
@andreluisal
@andreluisal 9 жыл бұрын
Excellent video!
@poorianorouzi214
@poorianorouzi214 9 жыл бұрын
Thanks professor, please upload some videos about sensitivity and shadow price, kheylii khub boodm mamnun ,goftam farsi am tashakor karde basham ;)
@leddel746
@leddel746 9 жыл бұрын
the information is hard to read, please choose other font
@sxmirzaei
@sxmirzaei 9 жыл бұрын
That is my handwriting. I try to make it more legible next time. thanks for your feedback led del
@imedhosting
@imedhosting 8 жыл бұрын
+led del if you consider her handwriting as a font it means that her handwriting is beautiful hahahaha
@sankarkumar7898
@sankarkumar7898 9 жыл бұрын
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
@MerveNoyan
@MerveNoyan 8 жыл бұрын
You helped a lot but I didn't understand how and why you switched from s2 to e4
@sirousyousefnejad1658
@sirousyousefnejad1658 9 жыл бұрын
Thank u, very helpfull
@mariamilingou8217
@mariamilingou8217 8 жыл бұрын
So if I get it right..if the initial problem was a minimization problem then we would have to add e's to the
@sxmirzaei
@sxmirzaei 7 жыл бұрын
regardless of your objective function direction (Max or Min) when you have
@saihehehe
@saihehehe 8 жыл бұрын
thank you this is helpful 😘😗
@PassiveInnovation
@PassiveInnovation 7 жыл бұрын
Great tutorial
@manishjoshi539
@manishjoshi539 9 жыл бұрын
great video !!
@mahmodel-attar2856
@mahmodel-attar2856 8 жыл бұрын
thanks too much u r awesome :)
@camilot9501
@camilot9501 8 жыл бұрын
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?
@sxmirzaei
@sxmirzaei 7 жыл бұрын
no! only "a" variables are artificial variables. You have a feasible solution when e.g. e4=4. However, if any of your artificial variables (a variables) in the final optimal table are positive then you don't have a feasible solution
@logan89ism
@logan89ism 8 жыл бұрын
Hey Prof So do we use artificial variables in Simplex too in case we have a perfect equality constraint?
@sxmirzaei
@sxmirzaei 8 жыл бұрын
+Ashwin Nair yes, in that case you only add an artificial variable and you don't add any excess variable: x1+x2=1 --> x1+x2+a1=1
@logan89ism
@logan89ism 8 жыл бұрын
ok. Thanks
@Shumayal
@Shumayal 8 жыл бұрын
Why can't we add a positive M? I understand that we want to avoid a positive M as it's a maximization problem. But if we do add a +M to the objective function, after standardizing, it becomes -M. So by normal procedure we would automatically make that column as the pivot column because it's the MOST NEGATIVE number there?
@sxmirzaei
@sxmirzaei 8 жыл бұрын
please watch 4:21-6:49
@Shumayal
@Shumayal 8 жыл бұрын
Yes, I have. I understood that but I don't get why we can't do it this way? Thanks ma'am.
@farazraza4054
@farazraza4054 7 жыл бұрын
can you tell me how can we differ Big M method by simplex method..? by checking the constraint of inequalities ? if differ we use big M otherwise simplex . please comment.
@sxmirzaei
@sxmirzaei 7 жыл бұрын
If all constraints in an LP are in form of = or = signs we should use big M or two-phase method.
@kikkasluca
@kikkasluca 7 жыл бұрын
what if I decide to solve the min LP with the dual simplex ? do I still have to add an artificial variable in the
@malayait
@malayait 8 жыл бұрын
nice tutorial but what if we have two Ms in cost functions? how to get the new Z or cost function ?
@sxmirzaei
@sxmirzaei 8 жыл бұрын
+malayait if you have two Ms you have to add both Ms to your objective function. Example (note: this is a minimization problem): Min Z=x1+2x2 Z=X1+2X2+M1a1+M2a2 ---> Z-X1-2X2-M1a1-M2a2=0 X1>=2 X1-e1+a1=2 X1-X2>=3 X1-X2-e2+a2=3 X1,X2>=0 X1,X2>=0
@malayait
@malayait 8 жыл бұрын
+Shokoufeh Mirzaei thank you lecturer but i mean new z . mean the one which we have to use with. like you multiply M with r3 and then added to r4 to get new Z to use. sorry for bothering and last uncleare question
@sxmirzaei
@sxmirzaei 8 жыл бұрын
+malayait I see. you have to do it for both columns of a1 and a2. you can do it in two steps. first, use one of the rows to get rid of the M under a1, then use another row to get rid of the other M left in the row of Z. Note that when you are in the second step, you have to use the new row of z that you have created.
@malayait
@malayait 8 жыл бұрын
+malayait thank you so much .. :)
@sxmirzaei
@sxmirzaei 8 жыл бұрын
+malayait if you find a feasible solution, Ms will be eliminated from your objective function.
@methemamacita
@methemamacita 7 жыл бұрын
In some parts it's hard to see what you wrote, wish you wrote them bigger. But thanks a lot for the video! :)
@MW2KidGun
@MW2KidGun 8 жыл бұрын
thanks so much
How to Solve a Linear Programming Problem Using the Dual Simplex Method
11:07
How to Solve a Linear Programming Problem Using the Two Phase Method
17:02
Shokoufeh Mirzaei
Рет қаралды 149 М.
Kind Waiter's Gesture to Homeless Boy #shorts
00:32
I migliori trucchetti di Fabiosa
Рет қаралды 8 МЛН
Little brothers couldn't stay calm when they noticed a bin lorry #shorts
00:32
Fabiosa Best Lifehacks
Рет қаралды 18 МЛН
Schoolboy Runaway в реальной жизни🤣@onLI_gAmeS
00:31
МишАня
Рет қаралды 1,3 МЛН
Алексей Щербаков разнес ВДВшников
00:47
How to solve an Integer Linear Programming Problem Using Branch and Bound
16:49
Minimization with Mixed Problem Constraints: The Big M Method
32:15
Kayla Harville
Рет қаралды 26 М.
❖ The Big M Method : Maximization with Mixed Constraints ❖
35:48
How to Solve a Linear Programming Problem Using the Graphical Method
11:49
Shokoufeh Mirzaei
Рет қаралды 789 М.
Linear Programming
33:20
The Organic Chemistry Tutor
Рет қаралды 1 МЛН
Big M Method - Simplex Algorithm
6:03
Maths Help with Mr Orys
Рет қаралды 38 М.
Kind Waiter's Gesture to Homeless Boy #shorts
00:32
I migliori trucchetti di Fabiosa
Рет қаралды 8 МЛН