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 13 of 13 for “"revised simplex"”.

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

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

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

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

  3. Distributed algorithms for linear programming

    … goal in this dissertation is to adapt the revised simplex method for solving linear programs on a class of parallel computers, called distributed computers. The work consist of two parts. First, we study the serial revised simplex algorithm and provide mathematical characterizations of how …

    utk-theses Repository record for Distributed algorithms for linear programming (opens in a new tab)

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

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

    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)

  5. Experimental Software Package for Linear Programming

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

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

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

  7. Análise limite de problemas de estado plano

    … For solving the linear programming problem a revised Simplex algorithm was used in the computer program developed for checking the formulation.

    brazil-uerj Repository record for Análise limite de problemas de estado plano (opens in a new tab)

  8. Direct Design of a Portal Frame

    … programming problem. B. The application of the revised simplex method to the dual of a parametric original problem. C. The application of A and B above in the development of design aids for the optimum design of symmetrical single-bay, single-story portal frame. Specifically, design graphs for …

    portland-state Repository record for Direct Design of a Portal Frame (opens in a new tab)

  9. On Ranking the Relative Importance of Nodes in Physical Distribution Networks

    … programs, we develop a modification of the revised simplex method, which exploits several key aspects to gain efficiency. We combine these algorithms and methods, to give rankings of the relative importance of nodes in networks. In order to better understand the usefulness of our method, we …

    waterloo Repository record for On Ranking the Relative Importance of Nodes in Physical Distribution Networks (opens in a new tab)

  10. An application of personal microcomputer to solve mid-sized goal programming problems

    … goal programming problems utilizing the revised simplex method.</p><p>Goal programming is an extension of linear programming, but is more powerful and flexible than linear programming because of its capability in handling problems with multiple conflicting objectives, instead of dealing …

    njit Repository record for An application of personal microcomputer to solve mid-sized goal programming problems (opens in a new tab)

  11. Computer aids for reclaiming eastern surface mines as rangelands

    … combines a matrix generating subsystem with the revised simplex algorithm and cost minimization objective function to determine the optimal economic solution. Outputs from this model are interpreted and displayed through a report-generating routine. The union of these two sub-systems (FRSELECT …

    vt Repository record for Computer aids for reclaiming eastern surface mines as rangelands (opens in a new tab)

  12. Practical Implementations Of The Active Set Method For Support Vector Machine Training With Semi-definite Kernels

    … and numerically stable. First, an efficient revised simplex method is efficiently implemented for SVM training (SVM-RSQP) with semi-definite kernels and shown to out-perform competing active set implementations for SVM training in terms of training time as well as shown to perform on-par with …

    ucf Repository record for Practical Implementations Of The Active Set Method For Support Vector Machine Training With Semi-definite Kernels (opens in a new tab)

  13. Optimization algorithms applied to large petri nets

    … with a prespecified u and d which use the Revised Simplex DLPRS subroutine are obtained. Certain subclasses of PNs have well-defined reachability criteria. Computation time curves for these subclasses of PNs are obtained using a two-phase simplex subroutine. Some application issues are …

    ttu Repository record for Optimization algorithms applied to large petri nets (opens in a new tab)