Use the tableau method to solve the Dakota Furniture Company prob- lem we discussed in the class (Please refer to the Powerpoint file titled Simplex Algorithm). But start the tableau method with x3, s1, s3, and s4 basic. Do this by hand!!! It is designed to be an exercise for the exam. I suggest you make the variables basic in this order in the tableau: s1, x3, s3, s4. This will make your job easier.

Throughout this chapter, we use the Dakota Furniture problem of Section 4.5 (without the x25 constraint) as an example. For the Dakota problem, the analog of LP (1) is maxz=60x1+30x2+20x3+0s1+0s2s.t.8x1+6x2+x3+s14x1+2x2+1.5x3+s22x1+1.5x2+0.5x3+s3x1,x2,x3,s1,s2,s3+0s3=48=20=80 Throughout this chapter, we use the Dakota Furniture problem of Section 4.5 (without the x25 constraint) as an example. For the Dakota problem, the analog of LP (1) is maxz=60x1+30x2+20x3+0s1+0s2s.t.8x1+6x2+x3+s14x1+2x2+1.5x3+s22x1+1.5x2+0.5x3+s3x1,x2,x3,s1,s2,s3+0s3=48=20=80