Performance and Scalability of the Parallel Simplex Method for Dense Linear Programming Problems an Extended Abstract
نویسندگان
چکیده
منابع مشابه
Performance and Scalability of the Parallel Simplex Method for Dense Linear Programming Problems
Linear programming is of fundamental importance in many optimization problems. The simplex method [4] is a commonly used way of solving linear programming problems. Solving large instances of linear programming problems takes signi cant time; thus, solving linear programming problems in parallel o ers a viable path for speeding up this type of computation. A standard-form linear programming pro...
متن کاملSome new results on semi fully fuzzy linear programming problems
There are two interesting methods, in the literature, for solving fuzzy linear programming problems in which the elements of coefficient matrix of the constraints are represented by real numbers and rest of the parameters are represented by symmetric trapezoidal fuzzy numbers. The first method, named as fuzzy primal simplex method, assumes an initial primal basic feasible solution is at hand. T...
متن کاملTowards a practical parallelisation of the simplex method
The simplex method is frequently the most efficient method of solving linear programming (LP) problems. This paper reviews previous attempts to parallelise the simplex method in relation to efficient serial simplex techniques and the nature of practical LP problems. For the major challenge of solving general large sparse LP problems, there has been no parallelisation of the simplex method that ...
متن کاملA new approach to fuzzy quantities ordering based on distance method and its applications for solving fuzzy linear programming
Many ranking methods have been proposed so far. However, there is yet no method that can always give a satisfactory solution to every situation; some are counterintuitive, not discriminating; some use only the local information of fuzzy values; some produce different ranking for the same situation. For overcoming the above problems, we propose a new method for ranking fuzzy quantities based on ...
متن کاملParallel Algorithm Design on the WPRAM Model
This paper describes the WPRAM programming model, supported on a derivative of the Bulk Synchronous Parallel (BSP) architecture. The WPRAM provides a weakly coherent shared address space with asynchronous concurrent requests for shared variables. All operations have an associated time cost, and are scalable with respect to increasing machine size. This provides a basis for designing scalable pa...
متن کامل