CalcPath
Subjects
Dashboard
Diagnostic
Feedback
Search...
Flows and Linear Programming Duality
Max-flow min-cut, the algorithms that realise it, and the linear programming duality that explains every min–max theorem here.
0/13 mastered
1 / 13
Solve
max
3
x
+
4
y
\max\ 3x+4y
max
3
x
+
4
y
subject to
x
+
y
≤
5
x+y\le 5
x
+
y
≤
5
,
x
≥
0
x\ge0
x
≥
0
,
y
≥
0
y\ge0
y
≥
0
.
Review the explanation for this topic →
Your answer
Draw
Hint
Type your answer — press Enter to check
Enter your answer
x
y
( )
x
n
√
⌫
AC
7
8
9
+
4
5
6
−
1
2
3
×
0
.
a
b
Check
↵
÷
#12663
All topics
All Combinatorics topics