A simplex–interior algorithm for solving linear programming

A simplex–interior algorithm for solving linear programming

0.00 Avg rating0 Votes
Article ID: iaor20001120
Country: China
Volume: 16
Issue: 3
Start Page Number: 211
End Page Number: 227
Publication Date: Jul 1996
Journal: Journal of Systems Science and Complexity
Authors:
Keywords: interior point methods
Abstract:

According to the simplex method and long step path following algorithm, the author introduces an interior point algorithm with combinatorial characteristic for linear programming with inequality constraints. This method retains the advantages of the simplex method and interior method, and overcomes their deficiency. In any case, this method can terminate rapidly. The numerical results show the method to be effective.

Reviews

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