摘要
Since the simplex method[1]of linear programming was established in 1947. It has been im proving unceasingly. But a major breakthrough has not been been,only a little quantity of computation was decreased. In this paper,the computation of the first stage of artificial basis method[l] is omited. Therefore, computational quantity is decreased greatly.
Since the simplex method[1]of linear programming was established in 1947. It has been im proving unceasingly. But a major breakthrough has not been been,only a little quantity of computation was decreased. In this paper,the computation of the first stage of artificial basis method[l] is omited. Therefore, computational quantity is decreased greatly.
基金
science fund for middle age and young scholar of Ministry of Posts andTelecommunications, P. R. China
