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?
Watch video Linear Programming - Shadow Price, Slack/Surplus calculations online without registration, duration hours minute second in high quality. This video was added by user Joshua Emmanuel 03 August 2016, don't forget to share it with your friends and acquaintances, it has been viewed on our site 260,053 once and liked it 2.5 thousand people.