Two direct methods in linear programming

Two direct methods in linear programming

0.00 Avg rating0 Votes
Article ID: iaor2002447
Country: Netherlands
Volume: 131
Issue: 2
Start Page Number: 417
End Page Number: 449
Publication Date: Jun 2001
Journal: European Journal of Operational Research
Authors: ,
Keywords: game theory
Abstract:

In this paper, 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 compard with the original simplex method and the interior point methods, and illustrated by examples. Also, we investigate the elimination of excessive constraints.

Reviews

Required fields are marked *. Your email address will not be published.