{'fraction_non_alphanumeric': 0.014388489208633094, 'fraction_numerical': 0.0, 'mean_word_length': 5.185185185185185, '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 New Modified Simplex Method to Solve Quadratic Fractional Programming Problem and Compared it to a Traditional Simplex Method by Using Pseudoaffinity of Quadratic Fractional Functions

In this paper, we defined a new modified simplex method to solve quadratic fractional programming problem (QFPP) and suggested an algorithm for it. The algorithm of usual simplex method is also reported. The special case for this problem was solved by Converting objective function to pseudoaffinity of quadratic fractional functions (PQFF) to a linear programming problem to be solved by simplex method. Then the result is compared with a result, which obtained by new modified simplex method. These methods demonstrated by numerical examples. This work confirms that our techniques is valid and can be used to solve this particular type of QFPP.