MGOC10H3 Study Guide - Final Guide: Expected Value Of Perfect Information, Joule, Minimax
11 Apr 2016
School
Department
Course
Professor
Document Summary
Min cijxij (total transportation cost) i j s. t. Xij = dj for each destination j (demand constraints) i xij > 0 (nonnegativity constraints) for all i and j. If the total supply > total demand, a dummy destination is added with demand equal to the excess supply, and shipping costs from all sources are 0. If total supply is < total demand, a dummy source is added. Assignment problem -> min total cost assignment of m workers to m jobs, given that the cost of worker i performing job j is cij. Xij = 1 for each job j xij = 0 or 1 for all i and j (e. g if subcontractor i is assigned to project j, 0 otherwise) Note: a modification to the right-hand side of the first constraint set can be made if a worker is permitted to work more than 1 job. Xij < si for each source i j.
