Mathematics · Transportation Problem

Consider a transportation matrix where shipping costs per unit from Godowns (G1, G2, G3) to Outlets (A, B, C) are given by G1: [A=10, B=12, C=15], G2: [A=13, B=11, C=7], and G3: [A=8, B=14, C=16], with requirements at Outlets as A=115, B=40, C=100. If only Outlet 'A' is present, then what will be the minimum cost of supplying all its required quantities from the nearest godowns?