Summary Flashcards
Cut-and-Fix
Fix all Y that are 0 or 1 in LP-Relaxation
Relax-and-Fix
Divide Variables into Subsets U and Sets Q. Ex. 4 Subsets of 5 each. First impose first 10 Variables are binary. Solve. Second fix 5 Variables of Q1 to obtained value. Impose Q2u U2 (5-15) binary. Repeat.
RINS (Improvement)
Solve LP Relax. get feasible Sol. set all y that are the same in both solutions to that value.
Local Branching (Improvement)
Start from feasible solution. Solve MIP where not more than k variables differ from their value in the feasible solution.
Exchange (Improvement)
Divide variables into Groups. Fix Variables of one group to value obtained in feas. sol. Relax others to take binary values.
PROB
- LS
- WW (LS but without production costs)
- DLSI (LS but can only produce at capacity or nothing)
- DLS (DLSI without inital stock)
CAP
- C: Capacities Ct vary over time
- CC: Capacities Ct constant
- U: Uncapacitated
VAR
- B (Backlogging)
- SC (Start-Up Costs)
- ST (Start-Up Times)
- LB (Minimum Production Levels)
- SL (Sales and Lost Sales)
- SS (Safety Stocks)
B (Backlogging)
You can satisfy demand r later than required at a cost b.
SC (Start-Up Costs)
Costs g for set-up for machine y in t if z = 1) (Make sure that set-up happens in t but not in t-1)
ST (Start-Up Times)
Capacity is reduced by ST in t. Only occur if there is a start-up z = 1
LB (Minimum Production Levels)
Lower Bounds for production
SL (Sales and Lost Sales)
Problem -> Profit maximization, Amount v can be sold for c
SS (Safety Stocks)
Keep a safety stock
EVPI
Expected Value of Perfect Information
EVPI = WS - SP
WS = Wait and See Solution, Solution we would get if we could postpone the decision to take it after a scenario has realized