Biomedical Engineering Reference
In-Depth Information
Solving for the first value of
A
i
(
A
1
= 2) and ignoring the specific equation for
MaxValue
for clarity:
MaxValue
1,1
=
f
(
A
1
,
B
1
) =
f
(2, 9) = 5
MaxValue
1,2
=
f
(
A
1
,
B
2
) =
f
(2, 11) = 3
MaxValue
1,3
=
f
(
A
1
,
B
3
) =
f
(2, 1) = 0
MaxValue
1,4
=
f
(
A
1
,
B
4
) =
f
(2, 0) = 2
MaxValue
1,5
=
f
(
A
1
,
B
5
) =
f
(2, 3) = 8
MaxValue
1,6
=
f
(
A
1
,
B
6
) =
f
(2, 8) = 0
MaxValue
1,7
=
f
(
A
1
,
B
7
) =
f
(2, 1) = -2
MaxValue
1,8
=
f
(
A
1
,
B
8
) =
f
(2, 7) = 1
MaxValue
1,9
=
f
(
A
1
,
B
9
) =
f
(2, 5) = 2
MaxValue
1,10
=
f
(
A
1
,
B
10
) =
f
(2, 3) = 8
MaxValue
1,11
=
f
(
A
1
,
B
11
) =
f
(2, 2) = 4
If the branches of
A
and
B
have hundreds of sub-branches, representing hundreds of values, then the
problem is likely computationally infeasible. This is especially true if the
MaxValue
function, which
must be evaluated for each combination of variables, is also computationally intensive.
