Exercise 4.3

A standard maximizing Problem

  1. The largest negative number (indicator) in the last row identifies the entering variable.
  2. The smallest positive quotient identifies the leaving variable.
  3. Pivot and repeat.

Maximize z = 6x1+4x2
Subject to:x1+x2£16
x1+3x2£36
x1 £10
wherex1andx2³0

Slack variables, x3, x4, and x5, have been introduced into the constraints. The initial simplex tableau is shown below. It is up to you to calculate the quotients when needed. Have a pencil and some paper handy.

Solve this problem using
the simplex method
Basic x1 x2 x3 x4 x5 z RHS Leaving
x
x
x
z
Entering

Return to Index Return to top of page Return to Previous Exercise Proceed to Next Exercise