zbMATH — the first resource for mathematics

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.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
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)
Two direct methods in linear programming. (English) Zbl 0991.90087
Summary: We introduce two direct methods for solving some classes of linear programming problems. The first method produces the extreme vertex or a neighboring vertex with respect to the extreme point. The second method is based on the game theory. Both these methods can be used in the preparation of the starting point for the simplex method. The efficiency of the improved simplex method, whose starting point is constructed by these introduced methods, is compared with the original simplex method and the interior point methods, and illustrated by examples. Also, we investigate the elimination of excessive constraints.

90C05Linear programming
90C49Extreme-point and pivoting methods
90C51Interior-point methods
91A90Experimental studies in game theory
Full Text: DOI
[1] E.D. Andersen, J. Gondzio, C. Mészáros, X. Xu, Implementation of interior point methods for large-scale linear programming, Hec-Geneve, Technical Report 96/3, 1996 · Zbl 0874.90127
[2] Bounday, B. D.: Basic linear programming. (1984)
[3] Clausen, J.; Kraup, J.: The usefulness and beauty of combinatorial optimization. Yujor 5, 3-19 (1995) · Zbl 0832.90090
[4] D. Cvetković, M. Čangalović, Dj. Dugošija, V. Vujčić-Kovačević, S. Simić, J. Vuleta, Combinatorial optimization, Društvo Operacionih Istraživača Jugoslavije -- DOPIS, Beograd, 1996 (In Serbian)
[5] J. Czyzyk, S. Mehrotra, S.J. Wright, PCx User Guide, Optimization Thechnology Center, Technical Report 96/01, 1996
[6] J. Gondzio, HOPDM (Version 2.12): A fast LP solver based on a primal--dual interior point method, European Journal of Operational Research 85 (1995) 221--225 · Zbl 0925.90284
[7] Klee, V.; Minty, G. L.: How good is the simplex method. Inequalities III, 159-175 (1972) · Zbl 0297.90047
[8] V. Kovačević-Vujčić, Technical Report 901-98, Laboratory of Operations Research, Faculty of Organizational Sciences, November 1998
[9] V. Kovačević-Vujčić, Some computational experience with the HOPDM code, in: Proceedings of SYMOPIS ’97, 1997, pp. 383--385
[10] Owen, G.: Game theory. (1968) · Zbl 0159.49201
[11] Sakarovitch, M.: Linear programming. (1983) · Zbl 0521.90070
[12] Wolfram, S.: Mathematica: A system for doing mathematics by computer. (1991) · Zbl 0671.65002
[13] S. Wolfram, Mathematica Book, Version 3.0, Wolfram Media and Cambridge University Press, Cambridge, 1996
[14] S.J. Wright, Primal--Dual Interior Point Methods, SIAM, Philadelphia, 1997 · Zbl 0863.65031