Visualization in linear programming using parallel coordinates
作者：
Highlights：
•
摘要
With parallel coordinates n-variable Linear Programming Problems (LLPs) can be visualized and the solution process via the Simplex algorithm can be traced.
论文关键词：Computational geometry,Linear programming,Parallel coordinates,Simplex algorithm
论文评审过程：Received 6 August 1991, Revised 10 December 1992, Accepted 20 May 1993, Available online 19 May 2003.
论文官网地址：https://doi.org/10.1016/0031-3203(93)90027-T
