Escolar Documentos
Profissional Documentos
Cultura Documentos
- dual simplex
- cutting plane
- find largest fractional part in xb
- eq is sum of -coeffs's frac parts * x + slack var = - fractional part NOT ACTUALLY RIGHT
- use this stuff to create new row, pivot on this row thing, yay
HW 8
- lol branch and bound wtf
- GEOMETRIC B&B: draw out the equations onto a plane, then find optimal extreme point, if an
integral var isn't integral for this sol, choose to look at <= floor and >= ceiling. so then draw these plots
which are just slicing the original down the line x = cut. then just compute extreme points and their
vlaues for this. pick best one and check if var is now integral, if so terminal. otherwise keep repeating.
when all nodes are terminal, pick one with the highest (/lowest for min problem) value
HW 9
- min cost rule: easy just fill in min cost per row til exhausted
- vogel's rule: for each row, and each col, find diff between smallest and next smallest. select row or col
with biggest diff. allocate as much as possible to cheapest in that row/col. decrease supply in that row,
and demand in that col. if both are reduced to 0, just pick one to eliminate. this is the method where you
draw differences on perimeter, then keep recalcing them, while crossing out rows and cols.
- supply != demand
- create new col, all costs are 0, demand is equal to leftover supply
- what to do if row and col are both satisfied at same time?
5.2 stuff
- assignment problem
- have matrix of costs C
- for each row, sub smallest value from all entries, do the same for each col (sub the post-row
subtraction value (so it could be a 0))
- take 0s top to bottom from left to right to get one in col, and one in each row, if you can't do this (0 of
next col only occurs in row that we already took a 0 from), then try it again using a different 0 at some
point
Defs and stuff
EPT
- 1) if S nonempty and bounded, then OS exists at an EP
- 2) if S nonempty and nonbounded and OS exists, then occurs at EP
- 3) if OS DNE, then S empty or unbounded