We propose a primal network simplex algorithm for solving the max imum flow problem which chooses as the arc to enter the basis one that is closest to the source node from amongst all possible candidates. We prove that this algorithm requires at most nm pivots to solve a problem with n nodes and m arcs, and give implementat ions of it which run in O(nZm) time. Our algorithm is, as far as we kno...

An experimental computational study to compare the classical primal simplex algorithm and the exterior point algorithms for the transportation problem (TP) is presented. Totally, four algorithms are compared on uniformly randomly generated test problems. The results are very encouraging for one of the competitive algorithms. In particular, a dual forest exterior point algorithm is on average up...

In this paper we propose a novel distributed algorithm to solve degenerate linear programs on asynchronous peer-to-peer networks with distributed information structures. We propose a distributed version of the well-known simplex algorithm for general degenerate linear programs. A network of agents, running our algorithm, will agree on a common optimal solution, even if the optimal solution is n...

many ranking methods have been proposed so far. however, there is yet no method that can always give a satisfactory solution to every situation; some are counterintuitive, not discriminating; some use only the local information of fuzzy values; some produce different ranking for the same situation. for overcoming the above problems, we propose a new method for ranking fuzzy quantities based on ...

We consider a network simplex method using the primal-dual symmetric pivoting rule proposed by Chen, Pardalos, and Saunders. For minimum-cost network-flow problems, we prove global convergence of the algorithm and propose a new scheme in which the algorithm can start from an arbitrary pair of primal and dual feasible spanning trees. For shortest-path problems, we prove the strongly polynomial t...

Three types of fuzzy random programming for capacitated location-allocation problem with fuzzy random demands are proposed according to different criteria, including the expected value model, chanceconstrained programming and dependent-chance programming. Finally, integrating the network simplex algorithm, fuzzy random simulation and genetic algorithm, a hybrid intelligent algorithm is produced...

It is important to prevent access network from bottlenecking the end-to-end survivability, especially as voice, video, and data traffic are all delivered through the same access network. With economic constraints and limited routing capability, the structure of an access network is typically a “fat tree”, where the terminal has to relay the traffic from another terminal of the same or higher le...