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 20 of 99 for “"Simplex algorithm"”.

  1. GPU accelerated transportation simplex algorithm

    Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2024-08-01

    uiuc Repository record for GPU accelerated transportation simplex algorithm (opens in a new tab)

  2. THE SIMPLEX ALGORITHM FOR . UNDERWATER SOURCE LOCALIZATION

    … receiver array. A numerical method, called the simplex method, is then discussed. As an iterative algorithm, the simplex method can get an excellent accuracy of localization with a relatively high computational cost. Moreover, as a numerical algorithm, the simplex method can use the absolute …

    sask Repository record for THE SIMPLEX ALGORITHM FOR . UNDERWATER SOURCE LOCALIZATION (opens in a new tab)

  3. Range-dependent matched-field inversion using the downhill simplex algorithm

    … obtained is range dependent. The optimization algorithm involves a random search followed by local optimizations using the Downhill Simplex Algorithm (DSA). The method provides relatively rapid convergence and is straight forward to implement. The inversion technique is first applied to …

    uvic Repository record for Range-dependent matched-field inversion using the downhill simplex algorithm (opens in a new tab)

  4. A REVISED SIMPLEX ALGORITHM FOR LARGE-SCALE GOAL PROGRAMMING MODELS

    … this research are: (1) development of efficient algorithms for large-scale linear goal programming problems: RSMGP and RSMPGP, and (2) a comparison of their computational efficiency with existing algorithms. RSMGP is based on a combination of the revised simplex method with product form and the …

    nebraska Repository record for A REVISED SIMPLEX ALGORITHM FOR LARGE-SCALE GOAL PROGRAMMING MODELS (opens in a new tab)

  5. Automated Parallel Optimization of Simulation Parameters using Modified Nelder-Mead Simplex Algorithm

    … propose a modified parallelized Nelder-Mead (NM) simplex to allow multiple simulations to run for indefinite amounts of time until noise is adequately converged. Parallelizing the NM simplex has one more purpose: to be able to utilize a look-ahead NM simplex operation. The NM simplex was modified …

    clemson Repository record for Automated Parallel Optimization of Simulation Parameters using Modified Nelder-Mead Simplex Algorithm (opens in a new tab)

  6. DESIGN AND IMPLEMENTATION OF A VLSI SYSTOLIC ARRAY FOR THE TRANSPORTATION SIMPLEX ALGORITHM

    … of a systolic array for the transportation simplex algorithm is proposed. The transportation problem is one of the most important linear programming problems. It is a general problem of allocating limited resources among competing activities in an optimal way. A basic systolic cell design …

    sask Repository record for DESIGN AND IMPLEMENTATION OF A VLSI SYSTOLIC ARRAY FOR THE TRANSPORTATION SIMPLEX ALGORITHM (opens in a new tab)

  7. DESIGN AND IMPLEMENTATION OF A VLSI SYSTOLIC ARRAY FOR THE TRANSPORTATION SIMPLEX ALGORITHM

    … of a systolic array for the transportation simplex algorithm is proposed. The transportation problem is one of the most important linear programming problems. It is a general problem of allocating limited resources among competing activities in an optimal way. A basic systolic cell design …

    sask Repository record for DESIGN AND IMPLEMENTATION OF A VLSI SYSTOLIC ARRAY FOR THE TRANSPORTATION SIMPLEX ALGORITHM (opens in a new tab)

  8. AN INTERACTIVE APPROACH FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS (INTERACTIVE COMPUTER, NELDER-MEAD SIMPLEX ALGORITHM, GRAPHICS)

    … convergence results for the Nelder-Mead simplex algorithm are presented. Techniques for updating the single-objective problem after each piece of information is obtained from the user are described. These techniques are based on the duality theory for linear and quadratic programming. A …

    rice Repository record for AN INTERACTIVE APPROACH FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS (INTERACTIVE COMPUTER, NELDER-MEAD SIMPLEX ALGORITHM, GRAPHICS) (opens in a new tab)

  9. Determination of the circulation center and inner core evolution of Hurricane Danny (1997) using the GBVTD-Simplex algorithm

    … the ground-based velocity track display (GBVTD) algorithm. The GBVTD technique is applied to 5-hours of data gathered simultaneously by two WSR-88D radars in Mobile, AL (KMOB) and Slidell, LA (KLIX) at ~6 minute intervals. The circulation centers and the primary circulations of Danny derived from …

    hawaii Repository record for Determination of the circulation center and inner core evolution of Hurricane Danny (1997) using the GBVTD-Simplex algorithm (opens in a new tab)

  10. Linear optimization and image reconstruction

    The Simplex algorithm, developed by George B. Dantzig in 1947 represents a quantum leap in the ability of applied scientists to solve complicated linear optimization problems. Subsequently, its utility in solving finite models, including applications in transportation, production planning, and …

    nps Repository record for Linear optimization and image reconstruction (opens in a new tab)

  11. Implementação paralela escalável e eficiente do algoritmo simplex padrão em arquitetura multicore

    … parallel implementation of the Standard Simplex algorithm in the multicore architecture to solve large scale linear programming problems. We present a general scheme explaining how each step of the standard Simplex algorithm was parallelized, indicating some important points of the …

    brazil-ufrn Repository record for Implementação paralela escalável e eficiente do algoritmo simplex padrão em arquitetura multicore (opens in a new tab)

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

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

    … 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)

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

  15. Experimental Software Package for Linear Programming

    … programming has been developed using the revised simplex and dual simplex algorithms. The design of the program incorporates an experimental change in the dual simplex algorithm. If the entered problem is not primal feasible, a modified dual simplex algorithm is used. The traditional dual simplex …

    ucf Repository record for Experimental Software Package for Linear Programming (opens in a new tab)

  16. An algorithm for the solution of linear programming problems using step-by-step addition of constraints.

    … important. A variation of the revised simplex algorithm, in which the constraints are added in a step-by-step fashion, is investigated as a potentially faster solution technique. A computational procedure, coded for the IBM 360 computer, is developed to compare this algorithm with the …

    nps Repository record for An algorithm for the solution of linear programming problems using step-by-step addition of constraints. (opens in a new tab)

Page 1 of 5