Scribd
Upload
3 views

Network Flow 4

The Microsoft Excel report indicates that the Solver found an optimal solution for a maximum flow problem with all constraints satisfied. The objective cell value increased from 0 to 14, with various variable cells showing their original and final values. The report details the constraints, binding statuses, and flow capacities between nodes in the network.

Uploaded by

Shivanshu Kumar Chaurasiya
Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
3 views

Network Flow 4

The Microsoft Excel report indicates that the Solver found an optimal solution for a maximum flow problem with all constraints satisfied. The objective cell value increased from 0 to 14, with various variable cells showing their original and final values. The report details the constraints, binding statuses, and flow capacities between nodes in the network.

Uploaded by

Shivanshu Kumar Chaurasiya
Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Microsoft Excel 16.

0 Answer Report
Worksheet: [networkflow4.xlsx]Sheet1
Report Created: 04-04-2025 16:14:09
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.016 Seconds.
Iterations: 10 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

Objective Cell (Max)


Cell Name Original Value Final Value
$K$7 O Out--In 0 14

Variable Cells
Cell Name Original Value Final Value Integer
$D$7 A Xij 0 3 Contin
$D$8 B Xij 0 7 Contin
$D$9 C Xij 0 4 Contin
$D$10 B Xij 0 0 Contin
$D$11 D Xij 0 3 Contin
$D$12 C Xij 0 0 Contin
$D$13 D Xij 0 4 Contin
$D$14 E Xij 0 3 Contin
$D$15 E Xij 0 4 Contin
$D$16 T Xij 0 8 Contin
$D$17 D Xij 0 1 Contin
$D$18 T Xij 0 6 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$K$8 A Out--In 0 $K$8=$M$8 Binding 0
$K$9 B Out--In 0 $K$9=$M$9 Binding 0
$K$10 C Out--In 0 $K$10=$M$10 Binding 0
$K$11 D Out--In 0 $K$11=$M$11 Binding 0
$K$12 E Out--In 0 $K$12=$M$12 Binding 0
$D$7 A Xij 3 $D$7<=$F$7 Not Binding 2
$D$8 B Xij 7 $D$8<=$F$8 Binding 0
$D$9 C Xij 4 $D$9<=$F$9 Binding 0
$D$10 B Xij 0 $D$10<=$F$10 Not Binding 1
$D$11 D Xij 3 $D$11<=$F$11 Binding 0
$D$12 C Xij 0 $D$12<=$F$12 Not Binding 2
$D$13 D Xij 4 $D$13<=$F$13 Binding 0
$D$14 E Xij 3 $D$14<=$F$14 Not Binding 2
$D$15 E Xij 4 $D$15<=$F$15 Binding 0
$D$16 T Xij 8 $D$16<=$F$16 Not Binding 1
$D$17 D Xij 1 $D$17<=$F$17 Binding 0
$D$18 T Xij 6 $D$18<=$F$18 Binding 0
Practical 4:-
Seervada maximum Flow Problem

From To Xij Sign Capacity Nodes Flow out Flow IN


O A 3 <= 5 O 14 0
O B 7 <= 7 A 3 3
O C 4 <= 4 B 7 7
A B 0 <= 1 C 4 4
A D 3 <= 3 D 8 8
B C 0 <= 2 E 7 7
B D 4 <= 4 T 0 14
B E 3 <= 5
C E 4 <= 4
D T 8 <= 9
E D 1 <= 1
E T 6 <= 6
{For Transhipment Nodes }

Out--In Sign Demand /Supply


14 =
0 = 0
0 = 0
0 = 0
0 = 0
0 = 0
-14

You might also like