The simplex algorithm with a new primal and dual pivot rule
نویسندگان
چکیده
We present a simplex-type algorithm for linear programming that works with primal-feasible and dual-feasible points associated with bases that di er by only one column.
منابع مشابه
New variants of finite criss-cross pivot algorithms for linear programming
In this paper we generalize the so called rst in last out pivot rule and the most often selected variable pivot rule for the simplex method as proposed in Zhang to the criss cross pivot setting where neither the primal nor the dual feasibility is preserved The nite ness of the new criss cross pivot variants is proven
متن کاملA basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule
The dual Phase-I algorithm using the most-obtuse-angle row pivot rule is very efficient for providing a dual feasible basis, in either the classical or the basisdeficiency-allowing context. In this paper, we establish a basis-deficiency-allowing Phase-I algorithm using the so-called most-obtuse-angle column pivot rule to produce a primal (deficient or full) basis. Our computational experiments ...
متن کاملA Monotonic Build-Up Simplex Algorithm for Linear Programming
No part of this Journal may be reproduced in any form, by print, photoprint, mi-croolm or any other means without written permission from Faculty of Technical : Abstract We devise a new simplex pivot rule which has interesting theoretical properties. Beginning with a basic feasible solution, and any nonbasic variable having a negative reduced cost, the pivot rule produces a sequence of pivots s...
متن کاملA Pseudo Primal - Dual Integer Programming Algorithm *
The Pseudo Primal-Dual Algorithm solves the pure integer programming problem in two stages, systematically violating and restoring dual feasibility while maintaining an all-integer matrix. The algorithm is related to Gomory AlI-fnteger Algorithm and the Young Primal Integer Programming Algorithm, differing from the former in the dual feasible stage by the choice of cuts and pivot variable, and ...
متن کامل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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 16 شماره
صفحات -
تاریخ انتشار 1994