Reduction-by-Projection Method for Linear Programming Problems

Article Preview

Abstract:

This paper defines the projection of algebic systems, and studies the projecting algorithm for linear systems. As its application, a new method is given to solve linear programming problems, which is called reduction-by-projection method. For many problems, especially when the problems have many constraint conditions in comparison with the number of their variables, the method needs less computation than simplex method and others. The great advantage of the method is shown when solving the integer linear programming problems.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1968-1971

Citation:

Online since:

October 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Bazaraa, M. S, and J.J. Jarvis, Linear Programming and Network Flows, (Wiley, New York, 1977. ).

Google Scholar