Parallel Simplex Method Improvements

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improvements to Turing's method

This article improves the estimate of the size of the definite integral of S(t), the argument of the Riemann zeta-function. The primary application of this improvement is Turing’s Method for the Riemann zeta-function. Analogous improvements are given for the arguments of Dirichlet L-functions and of Dedekind zeta-functions.

متن کامل

Parallelizing the Dual Simplex Method Parallelizing the Dual Simplex Method

We study the parallelization of the steepest-edge version of the dual simplex algorithm. Three different parallel implementations are examined, each of which is derived from the CPLEX dual simplex implementation. One alternative uses PVM, one general-purpose System V shared-memory constructs, and one the PowerC extension of C on a Silicon Graphics multi-processor. These versions were tested on ...

متن کامل

2 the Simplex Method

Linear programming has many important practical applications, and has also given rise to a wide body of theory. See Section 50.9 for recommended sources. Here we consider the linear programming problem in the form of maximizing a linear function of d variables subject to n linear inequalities. We focus on the relationship of the problem to computational geometry, i.e., we consider the problem i...

متن کامل

Improvements of the Hermite-Hadamard inequality for the simplex

In this study, the simplex whose vertices are barycenters of the given simplex facets plays an essential role. The article provides an extension of the Hermite-Hadamard inequality from the simplex barycenter to any point of the inscribed simplex except its vertices. A two-sided refinement of the generalized inequality is obtained in completion of this work.

متن کامل

The Simplex Method

To understand how simplex solves a general linear programming problem, we need to know the answers to a number of questions: • How to determine if a minimum feasible solution has been found? • Which basic variable should become non-basic at a pivot step? • Which nonbasic variable is to enter the basis at a pivot step? • How to find an initial basic feasible solution to start simplex? We already...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: AL-Rafidain Journal of Computer Sciences and Mathematics

سال: 2005

ISSN: 2311-7990

DOI: 10.33899/csmj.2005.164089