Lec-7 Simplex Method | Minimization Problem | Mathematical Example Solution | Operations Research

#SimplexMethod #Minimization #OperationsResearch
This is Lecture-7 on the Operations Research video series. In this lecture, we will learn how to solve a Minimization Linear Programming Problem using Simplex Method.
Operations Research Lectures (Full Playlist) 👉 • Operations Research | ...

[@Clips-ns6eb]

Thank you very much for making the simplex, graphical method easily understandable.❤️❤️ Keep it up

[@madhugaur9308]

Great work 👍🏻

[@patrickjoseroxas1771]

Hi thank you for this holistic tutorial, but I have a question for the final answer (-11) for the objective function which represents the quantity that we need to minimize , these value should be non-negative. how can you interpret if the answer became negative

[@juliennebitjel2606]

Hello Mme Please it possible that the resolution of the LP using the Simplexe methods and using the graphic method give us different optimal solution ?

[@JustinMulamba-cb7ds]

Impressed mom

[@edhahaz]

[max]Z𝒋 = 𝒄𝒋 − 𝒇𝒋; [min]Z𝒋 =𝒇𝒋 − 𝒄𝒋. In video, why use [min]𝚫 to calculate a max objective ?

[@aspect3210]

Where do you get the 2/5 in 34:18 ?

[@yumnanizar6555]

The value in the position is 5/2..so to make the value 1 we have multiply it by 2/5. 5/2*2/5=1

[@biniyamkebede1462]

how we convert z min to z max

[@manas_sharma31]

by multiplying the z min eqn to -1

[@natran375]

Loveee

[@1234567891011121test]

the constant 'subscribe' pop up is really distracting.

[@editx7574]

Goooddddddddddd

[@aminutukur5981]

Even a person without engineering background will understand this explanation

[@aarzu8683]

Yupp we r economics student still we understand her lectures ❤