The Transportation Problem is a special linear programming problem for optimizing shipment from sources (suppliers) to destinations (consumers) at minimum cost. Given: m sources with supplies sᵢ, n destinations with demands dⱼ, and unit transportation costs cᵢⱼ. Objective: minimize Σᵢ Σⱼ cᵢⱼxᵢⱼ subject to: Σⱼ xᵢⱼ = sᵢ (supply constraints), Σᵢ xᵢⱼ = dⱼ (demand constraints), xᵢⱼ ≥ 0. The problem has a totally unimodular constraint matrix, ensuring integer optimal solutions. Solution methods include: Northwest corner rule, Vogel's approximation method, and the transportation simplex algorithm. Extensions include: transshipment problems and assignment problems.