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 3 of 3 for “"Exterior point algorithms"”.
-
A non-monotonic infleasible interior-exterior point algorithm for linear programming
The vast majority of Linear Programming algorithms restrict the use of any vertex as starting basis, into being either primal feasible, dual feasible, or even both (Primal – Dual Two path pivoting algorithms). A reasonably large amount of research has been conducted the latest decades to relax …
-
Υπολογιστικές βελτιώσεις και αποτελεσματική υλοποίηση περιστροφικών αλγορίθμων δύο δρόμων
… 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. In the early 1990s, a new class of simplex type algorithms appeared in the international …
-
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 …