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 165 for “"Simplex method"”.

  1. Linear Programming Using the Simplex Method

    … problems, the theoretical foundations of the simplex method, and how a liner programming problem can be solved with the simplex method.

    unt Repository record for Linear Programming Using the Simplex Method (opens in a new tab)

  2. DOUBLE-BASIS SIMPLEX METHOD FOR LARGE SCALE LINEAR PROGRAMMING.

    The basis handling procedures of the simplex method are formulated in terms of a "double basis". That is, the basis is factored as (DIAGRAM OMITTED...PLEASE SEE DAI) where ‘B, the pseudobasis matrix, is the basis matrix at the last refactorization. P and Q are permutation matrices. Forward and …

    arizona-thes Repository record for DOUBLE-BASIS SIMPLEX METHOD FOR LARGE SCALE LINEAR PROGRAMMING. (opens in a new tab)

  3. Modified simplex method for the (axial) multi-index assignment problem, A

    Includes bibliographical references (pages 149-152).

    colo-mines Repository record for Modified simplex method for the (axial) multi-index assignment problem, A (opens in a new tab)

  4. Optical measurement of particle size distribution function using downhill simplex method : theory and experiment

    <p>A new method is introduced for retrieving the particle size distribution function (PSDF) from optical measurements. Criteria are derived and demonstrated for assessing the validity of the multi-dimensional least-squares deconvolution results derived from experimental data. Using the covariance …

    utk-theses Repository record for Optical measurement of particle size distribution function using downhill simplex method : theory and experiment (opens in a new tab)

  5. The Optimization of Machining Parameters for Milling Operations by Using the Nelder Mead Simplex Method

    … CNC milling operations. A variety of numerical methods are used to optimize the machining process, such as the genetic algorithm, tabu search method, and ant colony algorithm. In CNC milling operations, an objective function proposed by Tolouei and Bidhendi [1996] was used to estimate the profit …

    portland-state Repository record for The Optimization of Machining Parameters for Milling Operations by Using the Nelder Mead Simplex Method (opens in a new tab)

  6. THE SIMPLEX ALGORITHM FOR . UNDERWATER SOURCE LOCALIZATION

    … objective of this thesis is to find an effective method for underwater acoustic source localization in a multipath deep-ocean environment. The model discussed in this thesis consists of a submerged three-sensor receiver system and a broad-band noise source. Only two propagation paths (direct path …

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

  7. Polyhedral Diameters and Applications to Optimization

    The Simplex method is the most popular algorithm for solving linear programs (LPs). Geometrically, it moves from an initial vertex solution to an improving neighboring one, selected according to a pivot rule. Despite decades of study, it is still not known whether there exists a pivot rule that …

    waterloo Repository record for Polyhedral Diameters and Applications to Optimization (opens in a new tab)

  8. Special versus standard algorithms for large-scale harvest scheduling problems

    … is greatly reduced over that for the revised simplex method. The Dantzig-Wolfe algorithm is coded and tuned to solve general Model II problems, taking advantage of the Longest Path Algorithm in the subproblem step, and using the revised simplex method to solve the master problems. …

    vt Repository record for Special versus standard algorithms for large-scale harvest scheduling problems (opens in a new tab)

  9. The signal flow graph theory approach to goal programming: Design and implementation of a pedagogic system

    … the concept of GP properly because the modified simplex method involves difficult mathematics. This induces the students to try to memorize the solution procedures (rules and formulas) instead of understanding the underlying concept. To overcome students' formula dependency, the Signal Flow Graph …

    nebraska Repository record for The signal flow graph theory approach to goal programming: Design and implementation of a pedagogic system (opens in a new tab)

  10. Nonsmooth Newton Methods for Solving the Best Approximation Problem; with Applications to Linear Programming

    … regularization to a nonsmooth Newton method. We expand this application to exact and inexact nonsmooth Newton methods and apply it to the best approximation constrained to a polyhedral set problem. We also demonstrate that linear programs can be represented as a best approximation …

    waterloo Repository record for Nonsmooth Newton Methods for Solving the Best Approximation Problem; with Applications to Linear Programming (opens in a new tab)

  11. Small Signal Equivalent Circuit Extraction From A Gallium Arsenide MESFET Device

    … models and S-parameters are explained. The Simplex Method is used to optimize the small signal equivalent circuit model. A thorough analysis of the strengths and weaknesses of the Simplex method is performed.

    vt Repository record for Small Signal Equivalent Circuit Extraction From A Gallium Arsenide MESFET Device (opens in a new tab)

  12. Airline crew pairing optimization problems and capacitated vehicle routing problems

    … this research work is to investigate effective methods for solving large scale crew pairing problems and vehicle routing problems. In the airline industry, to address the complex nature of crew pairing problems, we propose a duty tree method followed by a primal-dual subproblem simplex method. …

    gatech Repository record for Airline crew pairing optimization problems and capacitated vehicle routing problems (opens in a new tab)

  13. Design Optimization for a CNC Machine

    … and better productivity. The Nelder-Mead Simplex method with exterior penalty functions was employed to solve optimum machining parameters. Two case studies were presented for optimizing cost and time for a multiple tools scenario. In this study, the optimum machining parameters for …

    portland-state Repository record for Design Optimization for a CNC Machine (opens in a new tab)

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

    … RSMGP is based on a combination of the revised simplex method with product form and the modified simplex method while RSMPGP is a combination of the product representation of the inverse and some features of the goal partitioning algorithm. The explicit form of the inverse over the regular …

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

  15. Very large-scale linear programming: A case study in exploiting both parallelism and distributed memory

    … with parallel implementations of both the simplex method and interior point methods for solving real-world linear programs. Experience with a parallel implementation of CPLEX, a state of the art implementation of the simplex method, on an Intel distributed-memory multiprocessor machine will …

    rice Repository record for Very large-scale linear programming: A case study in exploiting both parallelism and distributed memory (opens in a new tab)

Page 1 of 9