In this paper we studied an integration scheme of some simplex algorithms and some efficient techniques to get the stable solution in linear programming code. And we developed a linear programming package (LPAK) by introducing this scheme and techniqu...
In this paper we studied an integration scheme of some simplex algorithms and some efficient techniques to get the stable solution in linear programming code. And we developed a linear programming package (LPAK) by introducing this scheme and techniques.
In LPAK three different algorithms were integrated, which were two primal simplex algorithms using Two phase method and big-M method respectively, and the dual simplex algorithm.
LPAK introduces several heuristic techniques in each step of simplex method in order to enhance the stability and efficiency.
They were new heuristic methods in structuring initial basis, choosing entering variable, choosing dropping variable and performing reinversion.
The experimental results on the NETLIB problems showed that LPAK provided the stable solutions.