Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 6 of 6 for “"Exterior point simplex"”.

  1. A dual network exterior point simplex-type algorithm for the minimum cost network flow problem

    … area of Network Optimization. A Dual Network Exterior Point Simplex Algorithm (DNEPSA) for the MCNFP is presented here. The algorithm belongs to the special category of Exterior Point Simplex-Type algorithms. Similarly to the classical Dual Network Simplex-type Algorithm (DNSA), DNEPSA starts …

    greece Repository record for A dual network exterior point simplex-type algorithm for the minimum cost network flow problem (opens in a new tab)

  2. Design and development of a hybrid mathematical programming algorithm

    … from NETLIB are also presented. Finally, simplex algorithm has been used in order to solve benchmarks before and after a new proposed presolve technique has been performed to LPs.Moreover, an experimental investigation of a variation of Primal-Dual Exterior Point Simplex Algorithm (PDEPSA) …

    greece Repository record for Design and development of a hybrid mathematical programming algorithm (opens in a new tab)

  3. Hybrid optimization algorithms: implementation on GPU

    … area in the field of operations research. The simplex algorithm is one of the top ten algorithms with the greatest influence in the 20th century and the most widely used method for solving LP problems. The main aim of this thesis is to investigate the computational aspects of two simplex type …

    greece Repository record for Hybrid optimization algorithms: implementation on GPU (opens in a new tab)

  4. Computational complexity analysis of linear optimization algorithms

    … results of our study on the performance of the Exterior Point Simplex algorithm, the Interior Point Method, and the Primal and Dual Simplex algorithms. Our objective is to generate valid and accurate prediction models for the computational performance of these algorithms. Our analysis is …

    greece Repository record for Computational complexity analysis of linear optimization algorithms (opens in a new tab)

  5. Παράλληλος προγραμματισμός αλγόριθμων για προβλήματα γραμμικού προγραμματισμού

    The Simplex Method, the most popular method for solving Linear Programs (LPs), has two major variants. They are the revised method and the standard, or full tableau method. Today, virtually all serious implementations are of the revised method because it is more efficient for sparse LPs which are …

    greece Repository record for Παράλληλος προγραμματισμός αλγόριθμων για προβλήματα γραμμικού προγραμματισμού (opens in a new tab)