{'fraction_non_alphanumeric': 0.01904761904761905, 'fraction_numerical': 0.0038095238095238095, 'mean_word_length': 5.255952380952381, '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}}
Relating reference points and weights in MOLP

A frequent problem for decision makers (DMs) analysing decisions involving multiple objectives is the identification and selection of the most preferred option from the set of non-dominated solutions. Two techniques, weighted sum optimization and reference point optimization, have been developed to address this problem for multiobjective linear programming problems (MOLP). In this paper, we examine the relationship between these two techniques. We demonstrate that the values of the dual variables associate with auxiliary constraints of the reference point technique are equal to the weight values used to compute the same non-dominated solution via the weighted sum technique. This insight will enable the development of new interactive solution procedures for MOLPs which allow the DM to readily switch from one method to the other during the search for the most preferred non-dominated solution. The advantages of the approach are discussed in the paper. Copyright © 1999 John Wiley & Sons, Ltd.