Practice: The Full Tableau Simplex Method

Recognition · Interpretation

A minimisation tableau has objective row c ¯ = ( 0 , 4 , − 2 , 0 , − 5 ) over columns x 1 to x 5 , where x 1 and x 4 are basic. Which columns are eligible to enter, and what decides the choice between them?

2 hints available, least help first.

Hint 1: Retrieval cue

A nonbasic variable sits at zero and can only increase. What sign of reduced cost makes increasing it lower the objective?

Hint 2: Concept cue

Check each nonbasic column separately, then ask whether the optimality test distinguishes between two negative entries.

Direct application · Error diagnosis

In a minimisation tableau, x 2 has been chosen to enter. Its column holds a 12 = 2 , a 22 = − 3 , a 32 = 4 , and the right-hand column holds b 1 = 12 , b 2 = 6 , b 3 = 8 .

What is the step length θ that the ratio test gives?

Enter the value. It is checked against the answer and the precision this task asks for.

2 hints available, least help first.

Hint 1: Retrieval cue

Which rows take part in the ratio test?

Hint 2: Concept cue

As the entering variable rises by θ , a basic variable changes by − θ times its column entry. Which sign of entry makes it fall?

Classification · Interpretation

A minimisation run reaches this tableau, with x 1 basic in row 1:

basis x 1 x 2 x 3 RHS
x 1 1 − 1 13
c ¯ 0 − 1 13

What does the method report, and why?

2 hints available, least help first.

Hint 1: Retrieval cue

Apply the optimality test first, then the ratio test. Which one fails to produce a candidate?

Hint 2: Concept cue

Ask what happens to x 1 as x 2 increases, given the − 1 in its row.

Construction · Direct application · Explanation

Consider

min − 2 x 1 − x 2 subject to x 1 + x 2 + x 3 = 4 , 2 x 1 + 2 x 2 + x 4 = 8 , x ≥ 0 .

(a) Build the initial tableau for the basis B = { 3 , 4 } , and say why no elimination is needed to make it canonical.

(b) Carry out one iteration in full: state the entering column and why, show the ratio test including which rows are eligible, name the leaving variable and the step, and give the updated tableau.

(c) Apply the optimality test to your new tableau and say what the method reports.

(d) The updated tableau has a feature worth naming. Identify it, say what it is called, and say what it does and does not imply about the answer.

(e) Verify your reported solution against the original program without using the tableau.

Write your answer, then compare it with the worked solution.

3 hints available, least help first.

Hint 1: Retrieval cue

Before pivoting, check whether the objective row already holds reduced costs for the stated basis.

Hint 2: Concept cue

Compute both ratios and compare them before choosing a leaving row.

Hint 3: Strategy cue

After pivoting, read the right-hand column entry by entry and ask whether every basic variable is strictly positive.

Compare with the worked solution

Comparing does not record a result. Judging your own written answer cannot show that you can do this without help.

(a) The initial tableau. | basis | x 1 | x 2 | x 3 | x 4 | RHS |
|---|---|---|---|---|---|
| x 3 | 1 | 1 | 1 | 0 | 4 |
| x 4 | 2 | 2 | 0 | 1 | 8 |
| c ¯ | − 2 | − 1 | 0 | 0 | 0 | No elimination is needed because the basic variables x 3 and x 4 are slacks with cost zero: their columns are already unit vectors in the constraint rows, and their entries in the objective row are already zero. Had a basic variable carried a nonzero cost, the objective row would have to be cleared in its column before it held reduced costs. The basic solution is x = ( 0 , 0 , 4 , 8 ) with objective 0 . (b) One iteration. Entering column. c ¯ 1 = − 2 and c ¯ 2 = − 1 are both negative. Taking the most negative, x 1 enters: each unit of x 1 lowers the objective by 2 before the step length is considered. Ratio test. Column 1 holds 1 in row 1 and 2 in row 2, both strictly positive, so both rows are eligible. The ratios are 4 / 1 = 4 and 8 / 2 = 4 . A tie. Either row may leave; take row 1, so x 3 leaves at θ = 4 . Pivot. The pivot entry is 1 , so row 1 is unchanged. Row 2 becomes row 2 minus 2 × row 1:

( 2 , 2 , 0 , 1 ∣ 8 ) − 2 ( 1 , 1 , 1 , 0 ∣ 4 ) = ( 0 , 0 , − 2 , 1 ∣ 0 ) .

The objective row becomes objective row plus 2 × row 1:

( − 2 , − 1 , 0 , 0 ∣ 0 ) + 2 ( 1 , 1 , 1 , 0 ∣ 4 ) = ( 0 , 1 , 2 , 0 ∣ 8 ) .
basis x 1 x 2 x 3 x 4 RHS
x 1 11104
x 4 00 − 2 10
x ∗ = ( 4 , 0 , 0 , 0 ) , z ∗ = − 8 ,

the objective being the negation of the bottom-right entry 8 . (d) The feature. The basic variable x 4 sits at zero, so the basic feasible solution is degenerate. The tie in the ratio test is what produced it: two basic variables reached zero at the same step, and only one could leave. What it implies: more than one basis describes this same corner, so the correspondence between bases and points is no longer one-to-one here. In a longer run it would raise the possibility of a pivot with θ = 0 , where the basis changes but the point does not, and repeated stalling of that kind can cycle without an anti-cycling rule. What it does not imply: the answer is not wrong, the problem is not ill-posed, and the optimality verdict stands. Degeneracy is a property of this vertex, not a defect in the computation. (e) Verification against the original. Substituting x = ( 4 , 0 , 0 , 0 ) : - constraint 1: 4 + 0 + 0 = 4 ✓
- constraint 2: 2 ( 4 ) + 2 ( 0 ) + 0 = 8 ✓
- sign restrictions: every component is ≥ 0 ✓
- objective: − 2 ( 4 ) − 1 ( 0 ) = − 8 , matching the value read from the tableau ✓ This check does not rely on any tableau entry being correct, which is why it is the one to run before reporting an answer.

A complete answer does each of these:

  • builds initial tableau
  • selects entering column
  • ratio test restricted
  • pivots correctly
  • names terminal condition
  • reads the answer
Practice data

Your practice record is stored in this browser only. Clearing it removes every answer and every scheduled review, and cannot be undone.

Results update as you type. Use the up and down arrow keys to move between results, Enter to open one, and Escape to close.

Type to search.

Settings

Appearance

Interface density

Your record

Your progress is stored in this browser and nowhere else: an identifier, the answers you have given, the mastery states and review schedule derived from them, and the lesson you last opened. Clearing it makes you a new learner on this device. It cannot be undone, and it will not affect your appearance or density settings.

Focus timer

Focus--minutes remaining

Phase

Kept in this browser only, and used to label the session in your own history.

Today

Nothing recorded yet. Finish a focus session and it will appear here.

Settings

Focus sessions between long breaks.

Sessions you are aiming for in a day.

Notifications

Your history

Sessions are stored in this browser and nowhere else. They are not evidence and never reach your mastery record.