Linear Programming and Game Theory 2 (AQA A-Level Further Maths): Quizzes

📚Quizzes
Simplex Algorithm
Sign up to keep practising.Create a free account to play more quizzes and track your progress.

Practise the questions

10 questions from this quiz

Show

When is the simplex algorithm essential for solving linear programming problems?

When there are 3+ decision variables

What does a slack variable represent in a constraint?

The unused capacity in constraint

What condition must all slack variables satisfy?

Must be non-negative

How do you choose the pivot column in the simplex algorithm?

Most negative coefficient

What is the formula for calculating θ\theta-values?

θi=vi/pi\theta_i = v_i / p_i

For which entries in the pivot column should you calculate θ\theta-values?

Positive entries only

How do you choose the pivot row?

Smallest θ\theta-value

When is the solution optimal in the simplex algorithm?

When no negative coefficients exist

Why must you use fractions rather than decimals in simplex calculations?

To avoid rounding errors

To minimise objective function CC, what should you maximise?

P=CP = -C

Join 100,000+ A-Level students studying Quizzes with us.

Select your subjects, and get access to A+ resources today.