Simplex method - Example 6 - Infeasible solution

In this video, you will learn how to solve linear programming problem using the simplex method with the special case of infeasibility.

[@sultanamoni8559]

Why cant i find this channel befor😢😢😢..thanks..i needed cj-zj type all simplex method..

[@maxusknowledge]

Thankyou

[@rahulshandilya4095]

Thank you sir!

[@krishnamurari5517]

awesome lectures!!

[@liamdoyle8103]

why does this show that it does not have a feasible solution, as oppose to it being unbounded?

[@marjundelfino8976]

ZERO MINUS M = MINUS M how pls explain THANKS

[@reemhesham7139]

because the zero does not change anything , so it will stay as -M

[@harleenkaur9883]

kya koi bta skta hai
simpex method k case me unbounded solution kbh ata hai ?
please

[@LoveNature55]

when smallest ratio can,t find. means unbounded

[@nikhildharra2868]

when all the ratios are negative

[@sachinsagar9345]

If all the values in the replacement ratio column is either -ve or infinite

[@shaktiprakash6382]

explanation not good

[@ree-ee7787]

thx

[@wail2670]

A1, S2 Not S1 , A1 -.-

[@sultanamoni8559]

No..negative part always skip..s1 ans a1