formulating a problem:
shade the…
unwanted region
find the optimal solution
draw an objective line and move is parallel, the last vertex to be crossed is the optimal solution.
branch and bound method
minimise problems branch and bound
round up the non-integer value
Simplex for minimise
multiply profit by -1
for conditions:
if (expression ≥ constant) multiply through by -1
if (expression ≤ constant) leave it as it is
Setting up the simplex table
Simplex method
ratio test
RHS/value in pivot column
the lowest non negative, non zero value is the pivot row
pivot row
the lowest non negative, non zero value from the ratio test is the pivot row
pivot column
the most negative value in the profit row
When does simplex stop
when non of the values in the pivot row are negative
reading off results from a simplex tableu
If the column for a variable has all 0s and 1s read of the RHS value where the 1 is.
If the column has other numbers variable = 0