Question: use LINGO programme 1. Minimum cost flow problem In the network given below, it is desired to transfer from Al and A2 supply points to
use LINGO programme
1. Minimum cost flow problem In the network given below, it is desired to transfer from Al and A2 supply points to T1 and T2 demand points with minimum cost. Values on the line show transportation cost for one unit. 30 140 (A1 45 T1) -120 35 100 A2 T2-90 75 Answer the following questions. (Please just filling the blanks). i. The amount transferred from Al to T1 is ... ii. The amount transferred from Al to T2 is iii. The amount transferred from A2 to T1 is iv. The amount transferred from A2 to T2 is v. The objective function value is .... units units units units Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
