{'fraction_non_alphanumeric': 0.01749271137026239, 'fraction_numerical': 0.0, 'mean_word_length': 5.0588235294117645, '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}}
MILP-Based Algorithm for the Global Solution of Dynamic Economic Dispatch Problems with Valve-Point Effects

The Dynamic Economic Dispatch (DED) problem consists in satisfying a certain demand for electric power among scheduled generating units over a certain interval of time while satisfying the operating constraints of these units. The consideration of the valve-point effect (VPE) makes the problem more practical but also more challenging due to the non-linear and non-smooth constraints that are required for representing the model. We present a method, based on a sequence of piecewise linear approximations, which produces a feasible solution along with a lower bound on the global solution. In this way, this deterministic approach can trade off the speed which characterizes certain heuristics that are usually used to solve the DED-VPE for a better solution and insights about the problem. The method is applied to a widely used case study and provides a lower solution objective than the best known solution to date.