See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
10 cards from this deck
Algebraic method to solve linear programming problems
Unused capacity in a constraint
Constraint is active/binding (using all capacity)
Choose most negative coefficient in objective row
θi=vi/pi\theta_i = v_i / p_iθi=vi/pi (value ÷ pivot column entry)
Row with smallest θ\thetaθ-value
No negative coefficients in objective row
Maximizing P=−CP = -CP=−C
Only for positive entries in pivot column
To avoid rounding errors accumulating through iterations
Select your subjects, and get access to A+ resources today.