Initial Simplex Tableau setup | Artificial Variables, Slack, Surplus | Iteration 0

This video shows how to set up the initial Simplex Tableau for a linear programming problem.
00:00 Intro
00:12 Example 1 (Slack only)
02:20 Minimization
02:47 Example 2 (Big M Method)
05:51 Calculating zj, cj - zj
06:27 Example 3 (Changing ≥ to ≤)
07:32 Summary
Solve Simplex LP (Intro): • Intro to Simplex Metho...
Solve Big M Method LP: • Simplex Method 2 | Big...

[@uuuummm9]

The video I was looking for. Saved to favorites.

[@angelinaansah9654]

I am so glad for coming across this video but today we learnt of a modified simplex tableau and I cannot find it in your playlist so please do a video on that. thanks a lot !!!!

[@muddhukrishnaaithem476]

Great work sir, Love from india.

[@marcelukeje3510]

You're a legend sir 🙌

[@shekharchaurasiya5236]

Thank you so much for your work. This video and the others are very helpful. 👏

[@joshemman]

You're very welcome!

[@keerthiconstance7605]

thank you so much

[@joshemman]

You're welcome Keerthi

[@xeviusUsagi]

in the case in which there are no slack or surplus variables (and therefore the system had from the beginning only equations)
or in the case in which there aren't enough slack variables to cover all rows of the tableau, how do we choose other variables for the basis?

[@joshemman]

If you have equations only, then you use artificial variables. I'm not clear about the second case you stated.

[@lutauwu6280]

Which ones are basic variables and which ones are not ?

[@joshemman]

See if this helps: ua-cam.com/video/9YKLXFqCy6E/v-deo.html

[@setolignBabu]

Please 1. Solve the following linear programming problem using the Simplex Method and discuss whether you find an optimal solution.
Maximize Z = 30X1 + 50X2
Subject to the constraints:
3X1 + X2 ≥ 9
X1 + 2X2 ≥ 12
X1 + X2 ≥ 9
and
X1, X2 ≥ 0

[@joshemman]

This is clearly an unbounded solution case. You cannot have a maximum if all your constraints are ≥.