{'fraction_non_alphanumeric': 0.018612521150592216, 'fraction_numerical': 0.0, 'mean_word_length': 5.103092783505154, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Technical Note - A Counterexample to the Rudimentary Primal Integer Programming Algorithm

This note describes the development of a counterexample to the rudimentary primal integer-programming algorithm. Two examples are given. The first shows the particular sequence of cuts that leads to a cycling process. Then, utilizing the algebraic implications of this sequence of cuts, a second example is developed that does not converge using the usual column-selection rule. A geometric interpretation is provided, and some comments are made on a means to force convergence in these two examples.