Practice: Basic Solutions

Recognition · Interpretation

A basic solution has been constructed from an independent set of columns. Which is guaranteed?

2 hints available, least help first.

Hint 1: Retrieval cue

Which restrictions did the construction actually use?

Hint 2: Concept cue

Could A B − 1 b have a negative entry?

Direct application · Construction

For A x = b with

A = ( 1 1 1 0 2 1 0 1 ) , b = ( 6 8 )

and basis B = { 1 , 2 } , what is the basic solution, and how many of its components are zero?

2 hints available, least help first.

Hint 1: Retrieval cue

Switch off the nonbasic variables first, then solve what is left.

Hint 2: Concept cue

How many variables did you set to zero to make the system square?

Comparison · Method selection

A proposed column set has det A B = 0 . What is the correct report?

2 hints available, least help first.

Hint 1: Retrieval cue

What does a zero determinant say about solving A B x B = b ?

Hint 2: Concept cue

Can a point be infeasible if no point was produced?

Error diagnosis · Explanation · Evaluation

A student works with x 1 + 2 x 2 + x 3 = 4 , 3 x 1 + x 2 + x 4 = 3 , x ≥ 0 and writes:

Taking B = { 1 , 2 } : the determinant of A B is 1 × 1 − 2 × 3 = − 5 , nonzero, so the columns are independent. Solving gives x 1 = 2 / 5 and x 2 = 9 / 5 . Both equations check out. So ( 2 / 5 , 9 / 5 , 0 , 0 ) is a vertex of the feasible region.

Verify the arithmetic, then say whether the conclusion follows.

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

2 hints available, least help first.

Hint 1: Retrieval cue

Work through the student's arithmetic yourself before judging the conclusion.

Hint 2: Concept cue

Which of the two standard-form requirements did the argument actually verify?

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.

Check the arithmetic first. With B = { 1 , 2 } the system is x 1 + 2 x 2 = 4 and 3 x 1 + x 2 = 3 . From the second, x 2 = 3 − 3 x 1 . Substituting: x 1 + 2 ( 3 − 3 x 1 ) = 4 , so x 1 + 6 − 6 x 1 = 4 , giving − 5 x 1 = − 2 and x 1 = 2 / 5 . Then x 2 = 3 − 6 / 5 = 9 / 5 . The student's numbers are correct.

Check the equalities. 2 / 5 + 18 / 5 + 0 = 20 / 5 = 4 . And 6 / 5 + 9 / 5 + 0 = 15 / 5 = 3 . Both hold exactly, as the student says.

Check the signs. x 1 = 2 / 5 > 0 , x 2 = 9 / 5 > 0 , x 3 = x 4 = 0 . Every component is nonnegative. So here the point is feasible, and the conclusion happens to be right.

But the reasoning does not support it. The student's argument runs: determinant nonzero, equations check out, therefore vertex. That chain is invalid, and it would produce the same confident conclusion on a system where the answer is wrong. The sign test never appeared in it.

A case that breaks it. Keep the same A and basis, and change the right-hand side to b = ( 4 , 12 ) T . Then x 1 + 2 x 2 = 4 and 3 x 1 + x 2 = 12 give x 1 + 24 − 6 x 1 = 4 , so − 5 x 1 = − 20 , x 1 = 4 , and x 2 = 12 − 12 = 0 . Now try b = ( 10 , 3 ) T : x 1 + 2 x 2 = 10 , 3 x 1 + x 2 = 3 give x 1 + 6 − 6 x 1 = 10 , so − 5 x 1 = 4 and x 1 = − 4 / 5 , with x 2 = 3 + 12 / 5 = 27 / 5 . The determinant is still − 5 , the equalities still check out exactly, and ( − 4 / 5 , 27 / 5 , 0 , 0 ) is not feasible and not a vertex.

What the student is missing. A step, not an answer. The construction guarantees A x = b and nothing else; feasibility requires testing x ≥ 0 on the result. Getting the right verdict without that test is luck, and it is the kind of luck that runs out silently.

A complete answer does each of these:

  • basis verified
  • solution constructed
  • feasibility tested separately
  • counts zero components

Transfer · Interpretation · Explanation

A solver's log reports, at each iteration, the current basis as a list of variable indices rather than the point itself.

Say why a basis is sufficient to recover the point, what the solver must additionally check before treating that point as a corner, and what it would mean for the log to show the same point at two consecutive iterations with different bases.

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

2 hints available, least help first.

Hint 1: Retrieval cue

What do you need in order to turn a list of indices into a point?

Hint 2: Strategy cue

For the last part, ask how many bases a single corner can have.

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.

Why the basis suffices. A basis determines its basic solution uniquely: set every nonbasic variable to zero and solve A B x B = b , giving x B = A B − 1 b . Nothing else is needed, so the list of indices is a complete description of the point. Logging m indices rather than n numbers is also considerably more compact.

What must additionally hold. That x B ≥ 0 . The construction guarantees the equality constraints only, so a basis alone does not certify a corner. Inside the simplex method this test is not performed as a separate step at each iteration. It is maintained as an invariant: the method starts from a basic feasible solution, and the minimum ratio test chooses the step precisely so that no component is driven negative. The sign test has been folded into the ratio test, which is why it is no longer visible.

Two iterations, same point, different bases. That is degeneracy. A corner with fewer than m strictly positive components can be described by more than one basis, so a swap changed the basis while the point stayed put. The step length was zero.

What it signals. Not an error. It means the method stalled. One iteration spent without progress in position or objective value. Occasional stalling is ordinary; a repeating cycle of it is the pathological case that anti-cycling rules exist to prevent, and a log showing the same point recurring over many iterations is the symptom worth investigating.

Why this reading requires the unit. A learner who treats a basis and a point as interchangeable has no account of two bases naming one point, and reads the log as a bug in the solver rather than a property of the geometry.

A complete answer does each of these:

  • basis verified
  • solution constructed
  • feasibility tested separately
  • counts zero components
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.