On visualization of solutions of linear programming problems

This paper deals with the visualization method of solutions of the linear programming problem. We used the revised simplex method for the LP algorithm. To represent the solutions at each iteration, we need the informations of feasible region and animated effect of solutions. For the visualization in high dimension space, we used the method of projection to the three dimensions if the decision variable vector is over three dimensions, and we studied the technique of preserving original polyhedral information such as the number of vertices. In addition, we studied the method of visualizing unbounded feasible region and the adjacency relationship of the vertices which is indispensable to visualize feasible region.