{'fraction_non_alphanumeric': 0.01992966002344666, 'fraction_numerical': 0.0, 'mean_word_length': 5.832, '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 fractional programming problems with some multi-choice parameters

Linear fractional programming is a class of mathematical programming problem where we optimise the ratio of two linear functions subject to some linear constraints. In this paper, we present a linear fractional programming model where some or all the parameters are multi-choice type. We present a novel and efficient method, which integrates classical Charnes-Cooper transformation and Lagrange's interpolating polynomial, to transform multi-choice linear fractional programming problems into an equivalent mixed-integer nonlinear programming (MINLP) problems. A theorem is presented to establish the relation between the optimal solution of the multi-choice linear fractional programs and the equivalent MINLP. Some numerical examples are studied to illustrate the methodology.