Our current goal is: given a fractional solution to the flat norm LP, determine the integral solution to the ILP in polynomial time. On 2026-07-21 I gave a so called “tangent-descent” method which walked through the parameter space in order to find an integral solution. While it happened to work in this particular instance, I don’t think it will work in general. Mainly, I do not think the approach is sound and it assumes that every fractional solution has a corresponding integral solution with the same objective, which I do not believe to be true.

Notice that two basic solutions and are simultaneously optimal for parameters if where . Thus, given fractional, optimal we seek such that . Thus, instead of changing , we should find such that is orthogonal to . This leads to the following ILP:

which is just as hard as solving it as an ILP from the start.

Borrowing from 2026-07-21, let where . Then it follows that

as is linear. Then we can rewrite our ILP as follows:

But this still has our unfriendly integer constraint .

Consider the homology constraints:

implying that the set of which preserve the homology must satisfy the equation

i.e., belong to the kernel of . Define , , , then it follows that

which implies that . Indeed, I claim the basis for is given by

Notice that

Thus, any homology preserving perturbation is of the form

Looking at the integrality constraint, we get that

Combining equations, we get that

The second equation is easily satisfiable by saying that

for some . Solving for gives us that

for some . Solving for gives us that

for . Thus, our search space is restricted to

which can be reexpressed by where

Therefore, our new repair ILP is given by

where and . Unfortunately, this problem appears to still be NP-hard.

This also assumes that each fractional solution has an equivalent integral solution. We forgo this assumption by a slight tweak:

Note that

Thus, it follows that

i.e.,

We can also use the constraint and the convexity of our objective to eliminate and . That is, and are the smallest integers such that

where and max is taken elementwise. Thus, we may view and as functions of and all other terms are constants; so our objective can be expressed by

Which written as a sum is given by

Leaving the following integer nonlinear program: