Abstract: In the case of the proposed method, the problem is
parallelized by considering multiple possible mode of operation
profiles, which determine the range in which the generators operate
in each period. For each of these profiles, the optimization is carried
out independently, and the best resulting dispatch is chosen. For each
such profile, the resulting problem is a quadratic programming (QP)
problem with a potentially negative definite Q quadratic term, and
constraints depending on the actual operation profile. In this paper we
analyze the performance of available MATLAB optimization methods
and solvers for the corresponding QP.
Abstract: The performance of state of the art worldwide telecommunication networks strongly depends on the efficiency of the applied routing mechanism. Game theoretical approaches to this problem offer new solutions. In this paper a new continuous network routing model is defined to describe data transfer in fixed telecommunication networks of multiple hosts. The nodes of the network correspond to routers whose latency is assumed to be traffic dependent. We propose that the whole traffic of the network can be decomposed to a finite number of tasks, which belong to various hosts. To describe the different latency-sensitivity, utility functions are defined for each task. The model is used to compare router and host intelligent types of routing methods, corresponding to various data transfer protocols. We analyze host intelligent routing as a transferable utility cooperative game with externalities. The main aim of the paper is to provide a framework in which the efficiency of various routing algorithms can be compared and the transferable utility game arising in the cooperative case can be analyzed.