8,259 research outputs found

    On cycling in the simplex method of the Transportation Problem

    Get PDF
    This paper shows that cycling of the simplex method for the m×n Transportation Problem where k-1 zero basic variables are leaving and reentering the basis does not occur once it does not occur in the k×k Assignment Problem. A method to disprove cycling for a particular k is applied for k=2,3,34,5 and 6.Transportation Problem, Assignment Problem, cycling, basic solution, node, link, directed weighted tree.

    Switching in heteroclinic networks

    Get PDF
    We study the dynamics near heteroclinic networks for which all eigenvalues of the linearization at the equilibria are real. A common connection and an assumption on the geometry of its incoming and outgoing directions exclude even the weakest forms of switching (i.e. along this connection). The form of the global transition maps, and thus the type of the heteroclinic cycle, plays a crucial role in this. We look at two examples in R5\mathbb{R}^5, the House and Bowtie networks, to illustrate complex dynamics that may occur when either of these conditions is broken. For the House network, there is switching along the common connection, while for the Bowtie network we find switching along a cycle

    Survival of dominated strategies under evolutionary dynamics

    Get PDF
    We show that any evolutionary dynamic that satisfies three mild requirements— continuity, positive correlation, and innovation—does not eliminate strictly dominated strategies in all games. Likewise, we demonstrate that existing elimination results for evolutionary dynamics are not robust to small changes in the specifications of the dynamics
    corecore