{'fraction_non_alphanumeric': 0.01580135440180587, 'fraction_numerical': 0.0, 'mean_word_length': 5.434782608695652, '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}}
Linear Programming solvers for Markov Decision Processes

This paper describes linear programming solvers for Markov decision processes, as an extension to the JMDP program. JMDP is an object-oriented framework to model and solve Markov decision processes (MDP) programmed in Java. The developed solvers work for the discounted cost and average cost criteria. Our solvers are compared with existing value iteration and policy iteration solvers