In the examples given, I believe that any LP algorithm would be very fast but the number of keystrokes used would be very high.

Because the constraint matrix is really 2 joined identity matices, I suspect that somewhere in the literature a specialized solution has been developed for this problem that significantly reduces the complexity of the problem. Find this & you may have a winner.