See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
10 cards from this deck
A systematic method for solving linear programming problems (maximising or minimising)
Variables added to ≤\leq≤ constraints to convert them into equations
Unused capacity
x+y+s1=6x + y + s_1 = 6x+y+s1=6, s1≥0s_1 \geq 0s1≥0
Rows for constraints, columns for variables
Slack variables
Right-hand side of equations
Negative of objective function
Potential for improvement
Positive coefficients (not negative)
Select your subjects, and get access to A+ resources today.