{'fraction_non_alphanumeric': 0.024232633279483037, 'fraction_numerical': 0.0032310177705977385, 'mean_word_length': 4.961538461538462, '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}}
An Algorithm to Solve Fully Fuzzy Biobjective Linear Programming Based on the Compromise Programming with Respect to the Ideal Points

In this paper, a fully fuzzy biobjective linear programming (FFBOLP) problem will be considered, which all the parameters and variables are trapezoidal fuzzy numbers. In order to solve the FFBOLP, a compromise programming and a ranking function, which introduced by Yager (25), will be used to reach our goal. In fact, we are going to seek a fuzzy feasible solution as close as possible to the ideal points. Finally, a numerical example is displayed to illustrate the proposed method.