Documente Academic
Documente Profesional
Documente Cultură
In this example you will be solving a linear programming problem using the simplex method. After working through this
example, try to work some of the exercises from the book.
The example is found on Sheet 2. You can get there by clicking on the tab labeled "sheet 2" at the bottom left of the Excel
screen.
The objective is
z = 240x + 160y
The objective is
z = 240x1 + 160x2
Set it up in a matrix.
x1 x2 s1 s2 z solution
6 5 1 0 0 40
200 100 0 1 0 1000
-240 -160 0 0 1 0
6 5 1 0 0 40
1 0.5 0 0.005 0 5 simplify by multiplying by 1/200
-240 -160 0 0 1 0
0 2 1 -0.03 0 10 elimination
1 0.5 0 0.005 0 5
0 -40 0 1.2 1 1200 elimination
No further pivoting possible means one of the points we found must give the maximum. The choices
are z = 0, 1200 or 1400. Obviously the answer is 1400 so x1 = 2.5 and x2 = 5.
y multiplying by 1/200
y multiplying by 1/2