Big M Method Maximization Problem || Simplex Method || Operations Research || LPP

preview_player
Показать описание
Simple way to solve the Linear Programming Problem by Big-M Method for Maximization Problems with examples
Рекомендации по теме
Комментарии
Автор

Well explained to the point. You have made it clear

kellykaluba
Автор

For maximization, we consider the most negative value as the key column. How come you took the most positive instead?

programmingplug
Автор

i believe in the final table the s2 should not be present since it already left. including the s2 leads to negative cj-zj and thus its not complete so i believe you should not calculate it in the final table. Thank you the lesson was quite informative

PediWamemes
Автор

At 5:00, you forget to write s3 bigger or equal to 0

chinesecultureinessence
Автор

Thank you so much. We'll explained

njabulonzimande
Автор

I have an example here where my least ratios (b/KC) are +2.5 and -2. Which one am I supposed to use in determining my key row? Thank you

henrychristianwontumi
Автор

Sir Ydi subject to 4 equation diya h to kya kaise karna

pravinshah
Автор

Why We considered S1, S2, A1 in BV columns
Why not S3
Can we choose any 3 ?
I will be greatful if u answered my question

satwiktatikonda
Автор

Where did you get 24 in solution ? I can't understand hu hu hu hu please answer me

frontface
Автор

Its zj-cj not cj-zj aur isme most negative dekhte hai

KOMALMEENA-ey
Автор

Glat mat sikhaoo please look out for delta j

Pragati_