Diskussion:Integer linear optimization: Cutting Planes 4

Approach

Your Approach is well structured, but maybe a bit short. When you explain your Approach in a few more steps, maybe it would be easier to follow. You also got a small mistake in the last equation: $g_{i}$ has to be a part of the slack variable $BV'_{i}$ Apart from that it looks correct.

Example

I think your example is accurate to describe the mechanisms of the cutting planes. With the highlighting of the modules in the table it would be easier to follow to that what you've made in the correspondent step. I think the example is to short, because there is only one artificial restriction indicated. It could be more helpful to integrate more restriction to learn all mechanisms of the cutting planes.

I don't know why you transfer a maximization problem in a minimization problem. The normal Simplex Iterations are made for maximization problems. Your example covers not the special case what to do if there are two or more greatest fractions. It doesn't show what happens if a artificial restriction moves back to the basis. The calculation step of the new restriction is not clear. It isn't shown how the greatest fraction is chosen.

The example does not contain any mistakes.