Let a i is the total quantity of product available at origin i (i= 1,2,..,m) and b j is the total product required at destination j (j= 1,2, ..,n). Let x ij is the units shipped per route from source I to destination j and c ij is the cost of shipping one unit from source I to destination j for each route. For this given problem construct a standard form of linear programming problem and show it graphically.