zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study. (English) Zbl 0921.90119
Summary: We recently proposed several new pivot rules for achieving dual feasibility in linear programming, which are distinct from existing ones: the objective function value will no longer change necessarily monotonically in their solution process. In this paper, we report our further computational testing with one of them, the most-obtuse-angle rule. A two-phase dual simplex algorithm, in which the rule is used as a row selection rule for Phase-1, has been implemented in FORTRAN 77 modules, and was tested on a set of standard linear programming problems from NETLIB. We show that, if full pricing is applied, our code unambiguously will outperform MINOS 5.3, one of the best implementations of the simplex algorithm at present.

MSC:
90C05Linear programming
WorldCat.org
Full Text: DOI
References:
[1] Beale, E. M. L.: An alternative method for linear programming. Proceedings of Cambridge philosophical society 50, 513-523 (1954) · Zbl 0056.13705
[2] Dantzig, G. B.: The dual simplex algorithm. RAND report RM-1270 (1954) · Zbl 0057.15803
[3] Dantzig, G. B.: Linear programming and extensions. (1963) · Zbl 0108.33103
[4] Dantzig, G. B.; Orden, A.; Wolfe, P.: The generalized simplex method for minimizing a linear form under linear inequality restraints. Pacific journal of mathematics 5, 183-195 (1955) · Zbl 0064.39402
[5] Forrest, J. J. H.; Goldfarb, D.: Steepest-edge simplex algorithms for linear programming. Mathematical programming 57, 341-374 (1992) · Zbl 0787.90047
[6] Forrest, J. J. H.; Tomlin, J. A.: Vector processing in simplex and interior methods for linear programming. Annals of operations research 22, 71-100 (1990) · Zbl 0714.90064
[7] Gay, D. M.: Electronic mail distribution of linear programming test problems. Mathematical programming society COAL newsletter 13, 10-12 (1985)
[8] Goldfarb, D.: Using the steepest-edge simplex algorithm to solve sparse linear programs. Sparse matrix computations, 227-240 (1976) · Zbl 0345.65033
[9] Goldfarb, D.; Reid, J. K.: A practicable steepest-edge simplex algorithm. Mathematical programming 12, 361-371 (1977) · Zbl 0443.90058
[10] Greenberg, H. -J.: Pivot selection tactics. Design and implementation of optimization software, 109-143 (1978)
[11] Harris, P. M. J.: Pivot selection methods of the devex LP code. Mathematical programming 5, 1-28 (1973) · Zbl 0261.90031
[12] Murtagh, B.; Saunders, M.: MINOS 5.1 user’s guide, technical report, SOL 83-20R. (1987)
[13] Lemke, C. E.: The dual method of solving the linear programming problem. Naval research logistics quarterly 1, 36-47 (1954) · Zbl 0128.39605
[14] Pan, P. -Q.: Practical finite pivoting rules for the simplex method. OR spektrum 12, 219-225 (1990) · Zbl 0714.90063
[15] Pan, P. -Q.: Ratio-test-free pivoting rules for a dual phase-1 method. Proceedings of the third conference of chinese SIAM, 245-249 (1994)
[16] Pan, P. -Q.: Achieving primal feasibility under the dual pivoting rule. Journal of information & optimization sciences 15, No. 3, 405-413 (1994)
[17] Pan, P. -Q.: Composite phase-1 methods without measuring infeasibility. Theory of optimization and its applications, 359-364 (1994)
[18] Pan, P. -Q.: New non-monotone procedures for achieving dual feasibility. Journal of Nanjing university, mathematics biquarterly 12, No. 2, 155-162 (1995) · Zbl 0844.90055
[19] Pan, P. -Q.: A modified bisection simplex method for linear programming. Journal of computational mathematics 14, No. 3, 249-255 (1996) · Zbl 0856.65068