A method is provided for finding an initial regular solution of a linear programming in this paper. The key to this method is to solve an auxiliary linear programming instead of to introduce any artificial variable or...A method is provided for finding an initial regular solution of a linear programming in this paper. The key to this method is to solve an auxiliary linear programming instead of to introduce any artificial variable or constraint. Compared with the traditional method of achieving the regular solution by introducing an artificial constraint, it has advantages of saving the memories and little computational efforts.展开更多
A method is provided to achieve an initial basic feasible solution of a linear programming in this paper. This method dose not need introducing any artificial variable, but needs only solving an auxiliary linear progr...A method is provided to achieve an initial basic feasible solution of a linear programming in this paper. This method dose not need introducing any artificial variable, but needs only solving an auxiliary linear programming. Compared with the traditional two-phase method, it has advantages of saving the memories and reducing the computational efforts.展开更多
文摘A method is provided for finding an initial regular solution of a linear programming in this paper. The key to this method is to solve an auxiliary linear programming instead of to introduce any artificial variable or constraint. Compared with the traditional method of achieving the regular solution by introducing an artificial constraint, it has advantages of saving the memories and little computational efforts.
文摘A method is provided to achieve an initial basic feasible solution of a linear programming in this paper. This method dose not need introducing any artificial variable, but needs only solving an auxiliary linear programming. Compared with the traditional two-phase method, it has advantages of saving the memories and reducing the computational efforts.
