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 9 of 9 for “"Simplex type algorithms"”.

  1. 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)

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

    … 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 with a dual …

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

  3. Lp norm estimation procedures and an L1 norm algorithm for unconstrained and constrained estimation for linear models

    … procedures for L₁ estimation has been the simplex-type algorithms via the linear programming formulation. Other procedures are the reweighted least squares method, and. nonlinear programming technique using the penalty function approach or descent method. A new computational algorithm is …

    vt Repository record for Lp norm estimation procedures and an L1 norm algorithm for unconstrained and constrained estimation for linear models (opens in a new tab)

  4. Υπολογιστικές βελτιώσεις και αποτελεσματική υλοποίηση περιστροφικών αλγορίθμων δύο δρόμων

    … programming since the introduction of the simplex algorithm in 1947 by Dantzig. Researchers' interest turned to polynomial complexity algorithms in order to solve large-scale linear problems since the moment that the worst-case complexity of the simplex algorithm proved to be exponential. …

    greece Repository record for Υπολογιστικές βελτιώσεις και αποτελεσματική υλοποίηση περιστροφικών αλγορίθμων δύο δρόμων (opens in a new tab)

  5. Computational complexity analysis of linear optimization algorithms

    … and performance analysis in Linear Optimization algorithms have always been topics of particular interest among the Operational Research community. In the current thesis, we are presenting all aspects and analysis results of our study on the performance of the Exterior Point Simplex algorithm, …

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

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

    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)