Linear Programming - Shadow Price, Slack/Surplus calculations

This video shows how to solve the following problem.
Min Z = 5x1 + x2
s.t.
2x1 + x2 ≥ 6
X1 + x2 ≥ 4
2x1 + 10x2 ≥ 20
X1, x2 ≥ 0

a) Graphically solve the linear programming problem and determine the optimal solution.
b) What is the objective function value?
c) Calculate slack/surplus for each constraint.
d) If the RHS of Constraint #1 increases by 1, by how much would the OFV change?
e) If the RHS of Constraint #2 increases by 2, by how much would the OFV change?
f) Suppose x1 and x2 are required to be integers, what will the optimal solution be?

[nemesbence]

these five minutes were more useful than half a semester of lectures. Cheers, man!

[connorferguson]

Great format for the video, quick and to the point, and explaining exactly what needed to be said. Thanks!

[estefaniac]

Thank you so much for your video. I loved how you used this graphic explanation to illustrate shadow prices. You totally saved me.

[dextarndumia]

You're the best man.... These tutorials have saved me a lot of hustle

[mernadiaa]

Thank you !!!! you explained half of a semester to me

[PunmasterSTP]

This was incredible; you explained so many concepts so clearly! I've been looking for videos like these for a long time, and I'm so glad that I finally came across one.

[VivekGupta-vhti]

The best video till date on Linear Programming. Thank you very much

[tymothylim]

Thank you very much for this video, Joshua! I really enjoyed the use of visuals! I learnt what shadow price means as well!

[donjr]

Phew it was fast, had to pause and try to absorb it in. All the same, great video - helps a lot!

[jackli]

For the shadowing price part, I think you have to tell for more specific(seperate each step more clearly)

[moniruzzamanmonir]

take a bunch of thanks from Bangladesh

[Novana]

read some sheet 4 times of my professor than watched this, thanks man

[ZenoDiac]

Amazing. I can see you put a lot of work into making this video. It's very clear and concise. Well done!

[fitriawulandariramlan]

Hi, I think for the point 3, x1=2.5 and x1=1.5, so in the minutes 1:23, 5(2.5) + 1.5 = 14

[jayshinigami]

thx man i like ur videos
they are really ease to understand

[neon]

Hi Joshua, thanks for the vid. I still don't understand the part of finding shadow prices. Why the constraint x1>=0 was ignored? If the constraint became x1>=1, the optimal solution certainly will change as x1>= 0 is a binding constraint.

[amandeepsingh]

What is difference between canonical & standard forms of LPP? Please provide canonical form of LPP video.


Thanks for all videos of LPP. You explain very good in all videos.

[GMornat]

Whoah Thanks a lot it helped me to easily calculate Slack and Shadow Prices easily

[nirajvyas]

Thanks
Please give me your Divine blessings

[sathanasaetiao]

What if there's 3 variables, How can I solve for the shadow price?