Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 0991.90087
Stojković, Nebojša V.; Stanimirović, Predrag S.
Two direct methods in linear programming. (English)
[J] Eur. J. Oper. Res. 131, No.2, 417-439 (2001). ISSN 0377-2217

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.

MSC 2000:: *90C05 Linear programming
90C49 Methods of reduced gradient type
90C51 Interior-point methods
91A90 Experimental studies in game theory

Keywords: linear programming; tangential polyhedron; game theory; MATHEMATICA

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]