{'fraction_non_alphanumeric': 0.016166281755196306, 'fraction_numerical': 0.0, 'mean_word_length': 5.477611940298507, '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}}
A Constraint Qualification for a Dynamic Traffic Assignment Model

This note resolves a hitherto open question as to whether a dynamic traffic assignment model, which was developed and analyzed in earlier issues of this journal, satisfies a “constraint qualification.” It is shown that the model does in fact satisfy a constraint qualification, which establishes the validity of the optimality analysis presented by previous authors.