Part 1 - Solving a Standard Maximization Problem using the Simplex Method

Where did you get the negative 3?

your voice sounds like the guy from "Daily Dose of Internet"

What a useless professor I have. Explained it in a stupidly complex way. Thank you.

why S1 in the beginning is 1 and 0 and S2 is 0 and 1?

Thank you, so helpful!

hay

10 minutes to the exam🙏

Why am I learning this

I've made handouts for my students urging them to watch your video. You explain very well.

my question what of if ur smallest ratio is 3.75

3 minutes to exam. God bless

3 hours to exam bless

Wtf dude

Quatro about When 1 of the slack values is negative

Daily dose of internet is that u? Lol

Honestly what is the point of this maths...

You were amazing! Thank you. Please make a video on dual primal method. Please

why do we start with the highest coeficient in the obj. function?

Thank you for help me ❤️❤️❤️

you sound like daily dose of internet

Sir plz answer .. Why we convert minimize fn into maximize for solving it by simplex method??.

One step closer to the perfection.Thanks for this Video !

worthless explanation

Thanks Scott. I wish there was a little more context for this explanation though. Why are you doing what you’re doing? What cases are this method used for? Cheers.

very nice lecture

13hours to the exam

Explained so well. I can't believe my lecturer wasted his time writing his textbook for it to make no sense when the topic is this simple.

It was easy to understand until the calculator part. Thanks

U really speak well🥺🥺

how did we decide to write the coefficients of s1 and s2?

great explanation! thank you sir

Thanks for sharing

sounds like leafy

great thanks

7 mins to exam. Bless

you kinda sound like leafyishere lol

You are so stupid you are covering us and at the same time you want us to have nowlage.

How do I know the final optimization from the final table?

You are great!

never mind, where did you get that 3/5 on s2 for the 1st row?
FUCK ximplex

10 hours to the exam. Bless.

where did you get 8/5 where did 8 come when deciding where to pivot

The level of clearity exhibited in explaining this is nothing short of amazing ..wow

Thank you sir

please help some one
Using simplex-Method (or graphical solution methods) solve the linear programming problem:

(P) Max: z = 5x1 + 3x2
Subject to x1 − x2 ≤ 2
2x1 + x2 ≤ 4
−3x1 + 2x2 ≤ 6 x1 , x2 ≥ 0

Ho brother please start question from question statement

this is youuur daily dose of internet