Operations Research - Formula Sheet
Quick Revision
Transportation problem
- Minimise Z = sum over i and j of cij xij
- Supply constraints: sum over j of xij = ai, i = 1, 2, ..., m
- Demand constraints: sum over i of xij = bj, j = 1, 2, ..., n
- Non-negativity: xij ≥ 0
- Balanced: sum of ai = sum of bj
- Number of variables = mn; supply and demand constraints = m + n
- BFS: at most m + n - 1 allocations; non-degenerate: exactly m + n - 1; degenerate: fewer
- NWC first cell: x11 = min(a1, b1)
- VAM penalty = second least cost - least cost (in a row or column)
- Total cost = sum of (allocation × unit cost) over occupied cells
Assignment problem
- Minimise Z = sum of Cij xij, with each row sum and column sum of xij = 1, xij = 0 or 1
- Unbalanced: add a dummy row or column with zero costs
- Adding a constant to a row or column: same schedule, cost changes by that constant
- Optimal when each row and column has exactly one assignment
Decision theory
- k alternatives and n states of nature give k × n pay-offs
- Maximin value = maximum of the row minimum pay-offs
- Minimax value = minimum of the row maximum pay-offs
More for this chapter
Book Back Questions13 textbook MCQs · solved
Additional MCQs21 extra MCQs · solved
Practice TestInteractive · instant score
Book Back TestTest yourself on the textbook set
Additional MCQ TestTest yourself on the extra set
Study NotesConcepts & methods