Linear programming: simplex method
General · Mathematics
Study notes
Q: Solve by simplex: max 3x+2y s.t. x+2y ≤ 6, 2x+y ≤ 6, x,y ≥ 0. Tableau: basic s₁,s₂. z-row: -3, -2. Enter x (most negative -3). Ratios: 6/1, 6/2 = 3: leave s₂. Pivot: x = 3-0.5y-0.5s₂... new tableau. Next: enter y. Optimal: x = 2, y = 2, z = 10! Check: 2+4 = 6 ✓, 4+2 = 6 ✓: both tight! (Simplex: corner to corner!)