Review set
Simplex Iterations, Run to Termination
Programs carried through successive pivots until a stopping condition fires. Both representations appear, and not every run ends in an optimum: one terminates on an entering column with no positive entry, and one produces a degenerate basis on the way.
What this involves
Retrieval after a delay, which is what makes knowledge durable.
Answers here count towards what the system knows about your skills.
What this covers
- Execute one simplex iteration from a given basis
Given a standard-form minimization program and a basic feasible solution, the learner can select an entering variable from the reduced costs, apply the minimum ratio test to find the leaving variable and the step length, and report the resulting basis and basic feasible solution, without a tableau template.
- Run the simplex method to termination in a tableau
Given a standard-form minimisation and a starting basis, the learner can build the initial tableau, carry out successive pivots correctly, decide at each iteration whether to continue, and on stopping state which terminal condition fired and read the answer the tableau reports.
- Carry out a revised simplex iteration and say what it stores
Given a standard-form minimisation and a basis, the learner can compute the basis inverse and basic values, form the multipliers, price nonbasic columns to find an entering variable, compute the direction and step, report the updated basis, and account for which quantities the method stores against those a full tableau would carry.